Flattening fixed-angle chains is strongly NP-hard
12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings
Main Authors: | Demaine, Erik D., Eisenstat, Sarah Charmian |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Springer Berlin / Heidelberg
2012
|
Online Access: | http://hdl.handle.net/1721.1/73923 https://orcid.org/0000-0003-3803-5703 https://orcid.org/0000-0002-3182-1675 |
Similar Items
-
Solving the Rubik’s Cube optimally is NP-complete
by: Demaine, Erik D, et al.
Published: (2019) -
Rigid foldability is NP-hard
by: Demaine, Erik D, et al.
Published: (2020) -
Tetris is NP-hard even with O (1) Rows or Columns
by: Asif, Sualeh, et al.
Published: (2022) -
Who Needs Crossings? Hardness of Plane Graph Rigidity
by: Abel, Zachary R, et al.
Published: (2017) -
Finding a Hamiltonian Path in a Cube with Specified Turns is Hard
by: Abel, Zachary Ryan, et al.
Published: (2014)