From post

Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude.

, , , , , и . FUN, том 226 из LIPIcs, стр. 3:1-3:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

 

Другие публикации лиц с тем же именем

Folding Equilateral Plane Graphs., , , , , , и . ISAAC, том 7074 из Lecture Notes in Computer Science, стр. 574-583. Springer, (2011)This Game Is Not Going To Analyze Itself., , , , , , , и . CoRR, (2023)An Efficient Reversible Algorithm for Linear Regression., , и . ICRC, стр. 103-108. IEEE, (2021)Traversability, Reconfiguration, and Reachability in the Gadget Framework., , , , и . WALCOM, том 13174 из Lecture Notes in Computer Science, стр. 47-58. Springer, (2022)The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations., и . CCCG, стр. 114-128. (2018)Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible., , , , , , , и . FUN, том 100 из LIPIcs, стр. 3:1-3:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Computational Complexity of Portal and Other 3D Video Games., , и . FUN, том 100 из LIPIcs, стр. 19:1-19:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Arithmetic Expression Construction., , , , , , , , , и 3 other автор(ы). ISAAC, том 181 из LIPIcs, стр. 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard., , и . ITCS, том 151 из LIPIcs, стр. 62:1-62:42. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Cache-Adaptive Analysis., , , , , , , и . SPAA, стр. 135-144. ACM, (2016)