Complexity of the Stamp Folding Problem

DOI10.1007/978-3-642-22616-8_25zbMath1342.68149OpenAlexW14448367MaRDI QIDQ5199159

Ryuhei Uehara, Takuya Umesato, Toshiki Saitoh, Hiro Ito

Publication date: 12 August 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22616-8_25

zbMATH Keywords

NP-completenessoptimization problemlinkagepleat foldingrigid origami

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Complexity of the Stamp Folding Problem