Author of the publication

Tatamibari Is NP-Complete.

, , , , , and . FUN, volume 157 of LIPIcs, page 1:1-1:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

Cache-Adaptive Analysis., , , , , , , and . SPAA, page 135-144. ACM, (2016)A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard., , and . CoRR, (2018)Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard., , and . ITCS, volume 151 of LIPIcs, page 62:1-62:42. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Cookie Clicker., , , , , and . Graphs Comb., 36 (2): 269-302 (2020)Escaping a Polygon., , , , , , and . CoRR, (2020)Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard., , and . J. Inf. Process., (2020)Dynamic Boolean Formula Evaluation., , , and . ISAAC, volume 212 of LIPIcs, page 61:1-61:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Continuous Flattening of All Polyhedral Manifolds using Countably Infinite Creases., , , , , , and . CoRR, (2021)A Neural Network Solves and Generates Mathematics Problems by Program Synthesis: Calculus, Differential Equations, Linear Algebra, and More., , , , , , , , , and 4 other author(s). CoRR, (2021)Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets., , , and . Theor. Comput. Sci., (August 2023)