( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Complexity of Reconfiguration in Surface Chemical Reaction Networks.

, , , , , , , , , , , и . CoRR, (2023)

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.

No persons found for author name Diomidov, Yevhenii
add a person with the name Diomidov, Yevhenii
 

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

This Game Is Not Going To Analyze Itself., , , , , , , и . CoRR, (2023)Traversability, Reconfiguration, and Reachability in the Gadget Framework., , , , и . WALCOM, том 13174 из Lecture Notes in Computer Science, стр. 47-58. Springer, (2022)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)Traversability, Reconfiguration, and Reachability in the Gadget Framework., , , , и . Algorithmica, 85 (11): 3453-3486 (ноября 2023)Walking through Doors is Hard, even without Staircases: Proving PSPACE-hardness via Planar Assemblies of Door Gadgets., , , , , и . CoRR, (2020)Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines., , , , , , и . SAND, том 257 из LIPIcs, стр. 5:1-5:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Any platonic solid can transform to another by O(1) refoldings., , , , , и . Comput. Geom., (августа 2023)New Results in Sona Drawing: Hardness and TSP Separation., , , , , , , , и . CCCG, стр. 63-72. (2020)Complexity of Reconfiguration in Surface Chemical Reaction Networks., , , , , , , , , и 2 other автор(ы). CoRR, (2023)Strings-and-Coins and Nimstring are PSPACE-complete., и . CoRR, (2021)