Algorithmic folding complexity

DOI10.1007/S00373-011-1019-0zbMATH Open1234.68131OpenAlexW2783369107MaRDI QIDQ659709FDOQ659709

Authors: Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno 

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1019-0

Recommendations

• Algorithmic folding complexity
• Algorithmic complexity
• scientific article; zbMATH DE number 2102786
• On the complexity of string folding
• Complexity of the stamp folding problem
• Complexity of protein folding
• scientific article; zbMATH DE number 1759460
• The complexity of (un)folding
• Algorithmic relative complexity
• The Complexity of Near-Optimal Programmable Logic Array Folding

zbMATH Keywords

foldingalgorithm designmountain-valley patternsOrigami

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational aspects related to convexity (52B55) Combinatorics on words (68R15)

Cites Work

• Compression of individual sequences via variable-rate coding
• A universal algorithm for sequential data compression
• Algorithmic folding complexity
• When can you fold a map?
• Arithmetic and analytic properties of paper folding sequences

Cited In (8)

• The complexity of the stamp folding problem
• Algorithmic folding complexity
• Folding a paper strip to minimize thickness
• Efficient segment folding is hard
• Complexity of the stamp folding problem
• Folding a paper strip to minimize thickness
• Folding a better checkerboard
• A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS

This page was built for publication: Algorithmic folding complexity

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