The complexity of the stamp folding problem

DOI10.1016/J.TCS.2012.08.006MaRDI QIDQ391214zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Complexity of the stamp folding problem
• The complexity of (un)folding
• scientific article; zbMATH DE number 871913
• Algorithmic folding complexity
• Algorithmic folding complexity
• scientific article; zbMATH DE number 2102786
• On the complexity of string folding
• scientific article; zbMATH DE number 2217748
• The complexity of the pigeonhole principle

Cites work

• scientific article; zbMATH DE number 3852966 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Geometric folding algorithms. Linkages, origami, polyhedra
• Parametrized complexity theory.

Cited in

(6)

• Algorithmic folding complexity
• Complexity of the stamp folding problem
• A Closer Look at the Crease Length Problem
• Mechanical model analyses of a sheet under unidirectional multiple folding
• Folding a paper strip to minimize thickness
• Foldings and meanders

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391214)