SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Uno Yushi) "

Search: WFRF:(Uno Yushi)

  • Result 1-1 of 1
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Burke, Kyle, et al. (author)
  • Single-Player and Two-Player Buttons & Scissors Games
  • 2016
  • In: DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015. - Cham : SPRINGER INT PUBLISHING AG. - 9783319485324 - 9783319485317 ; , s. 60-72
  • Conference paper (peer-reviewed)abstract
    • We study the computational complexity of the Buttons amp; 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 the game is NP-complete if every color is used by at most F = 4 buttons but polytime solvable for F amp;lt;= 3. We also consider restrictions on the board size, cut directions, and cut sizes. Finally, we introduce several natural two-player versions of the game and show that they are PSPACE-complete.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-1 of 1

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view