Author of the publication

Computational Complexity of Generalized Push Fight.

, , and . FUN, volume 100 of LIPIcs, page 11:1-11:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players., , , , , , , , , and 5 other author(s). CoRR, (2020)Dissection with the Fewest Pieces is Hard, Even to Approximate., , , , , , and . CoRR, (2015)Tatamibari is NP-complete., , , , , and . CoRR, (2020)Tatamibari Is NP-Complete., , , , , and . FUN, volume 157 of LIPIcs, page 1:1-1:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible., , , , , , , and . FUN, volume 100 of LIPIcs, page 3:1-3:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Computational Complexity of Generalized Push Fight., , and . FUN, volume 100 of LIPIcs, page 11:1-11:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Arithmetic Expression Construction., , , , , , , , , and 3 other author(s). CoRR, (2020)Gloss: Seamless Live Reconfiguration and Reoptimization of Stream Programs., , , and . ASPLOS, page 98-112. ACM, (2018)Path Puzzles: Discrete Tomography with a Path Constraint is Hard., , , , , and . CoRR, (2018)Losing at Checkers is Hard., , , , and . CoRR, (2018)