Can I read NP-Hardness in Folding Problems on EtoBox?
NP-Hardness in Folding Problems by Math Homework Solver is a document available to read on EtoBox.
What is NP-Hardness in Folding Problems about?
The document provides solutions to 4 geometry problems involving identifying shadow trees and active folding paths in crease patterns, proving relationships between folding angles of a degree-4 vertex using spherical trigonometry, and showing the problem of finding a minimum length paper folding given a 1D crease pattern is NP-hard by reducing it from the partition problem.
- Author
- Math Homework Solver
- Language
- EN