From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets.

J. Ani, J. Bosboom, E. Demaine, Y. Diomidov, D. Hendrickson, и J. Lynch. FUN, том 157 из LIPIcs, стр. 3:1-3:23. 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.

Nilgün Erikli

Anders Erikson

Magdalena Karin Matilda Eriksson

Max-Peter Eriksen

Elina Eriksson

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

Basic network creation games.N. Alon, E. Demaine, M. Hajiaghayi, и T. Leighton. SPAA, стр. 106-113. ACM, (2010)Efficient constant-velocity reconfiguration of crystalline robots.G. Aloupis, S. Collette, M. Damian, E. Demaine, R. Flatland, S. Langerman, J. O'Rourke, V. Pinciu, S. Ramaswami, V. Sacristán и 1 other автор(ы). Robotica, 29 (1): 59-71 (2011)An end-to-end approach to making self-folded 3D surface shapes by uniform heating.B. An, S. Miyashita, M. Tolley, D. Aukes, L. Meeker, E. Demaine, M. Demaine, R. Wood, и D. Rus. ICRA, стр. 1466-1473. IEEE, (2014)Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.B. Aronov, P. Bose, E. Demaine, J. Gudmundsson, J. Iacono, S. Langerman, и M. Smid. LATIN, том 3887 из Lecture Notes in Computer Science, стр. 80-92. Springer, (2006)Meshes Preserving Minimum Feature Size.G. Aloupis, E. Demaine, M. Demaine, V. Dujmovic, и J. Iacono. EGC, том 7579 из Lecture Notes in Computer Science, стр. 258-273. Springer, (2011)Bumpy Pyramid Folding.Z. Abel, E. Demaine, M. Demaine, H. Ito, J. Snoeyink, и R. Uehara. CCCG, Carleton University, Ottawa, Canada, (2014)Locked and Unlocked Chains of Planar Shapes.R. Connelly, E. Demaine, M. Demaine, S. Fekete, S. Langerman, J. Mitchell, A. Ribó, и G. Rote. Discret. Comput. Geom., 44 (2): 439-462 (2010)Computing 3SAT on a Fold-and-Cut Machine.B. An, E. Demaine, M. Demaine, и J. Ku. CCCG, стр. 208-213. (2017)Path Puzzles: Discrete Tomography with a Path Constraint is Hard.J. Bosboom, E. Demaine, M. Demaine, A. Hesterberg, R. Kimball, и J. Kopinsky. Graphs Comb., 36 (2): 251-267 (2020)On universally easy classes for NP-complete problems.E. Demaine, A. López-Ortiz, и J. Munro. SODA, стр. 910-911. ACM/SIAM, (2001)

BibSonomy

Disambiguation