Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Gregg, Harrison"'
Autor:
Burke, Kyle, Demaine, Erik D., Gregg, Harrison, Hearn, Robert A., Hesterberg, Adam, Hoffmann, Michael, Ito, Hiro, Kostitsyna, Irina, Leonard, Jody, Löffler, Maarten, Santiago, Aaron, Schmidt, Christiane, Uehara, Ryuhei, Uno, Yushi, Williams, Aaron
We study the computational complexity of the Buttons \& Scissors game and obtain sharp thresholds with respect to several parameters. Specifically we show that the game is NP-complete for $C = 2$ colors but polytime solvable for $C = 1$. Similarly th
Externí odkaz:
http://arxiv.org/abs/1607.01826