Author of the publication

Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard.

, , and . J. Inf. Process., (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Optimal Staged Self-Assembly of General Shapes., , , , , and . Algorithmica, 80 (4): 1383-1409 (2018)One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece, , , , , , and . CoRR, (2012)Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard., , and . J. Inf. Process., (2020)Verification in staged tile self-assembly., , and . Nat. Comput., 18 (1): 107-117 (2019)Staged Self-assembly and Polyomino Context-Free Grammars.. DNA, volume 8141 of Lecture Notes in Computer Science, page 174-188. Springer, (2013)Complexities for High-Temperature Two-Handed Tile Self-assembly., , and . DNA, volume 10467 of Lecture Notes in Computer Science, page 98-109. Springer, (2017)An Optimal Algorithm for Tiling the Plane with a Translated Polyomino.. ISAAC, volume 9472 of Lecture Notes in Computer Science, page 3-13. Springer, (2015)Bounded-degree polyhedronization of point sets., , , , , , , , , and 1 other author(s). Comput. Geom., 46 (2): 148-153 (2013)Exploring agent-based simulations in political science using Aggregate Temporal Graphs., , , and . PacificVis, page 177-184. IEEE Computer Society, (2013)Turning Around and Around: Motion Planning through Thick and Thin Turnstiles., , , , , , , and . CCCG, page 377-387. (2021)