The complexity of the stamp folding problem

DOI10.1016/j.tcs.2012.08.006zbMath1416.68080OpenAlexW2028427412MaRDI QIDQ391214

Ryuhei Uehara, Yoshio Okamoto, Takuya Umesato, Hiro Ito, Toshiki Saitoh

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.006

zbMATH Keywords

NP-completenessoptimization problemlinkagepleat foldingrigid origami

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Folding a paper strip to minimize thickness ⋮ Mechanical model analyses of a sheet under unidirectional multiple folding

Cites Work

• Parametrized complexity theory.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of the stamp folding problem