Algorithmic Folding Complexity
From MaRDI portal
Publication:3652233
DOI10.1007/978-3-642-10631-6_47zbMath1273.52016OpenAlexW1498164696MaRDI QIDQ3652233
Martin L. Demaine, Ryuhei Uehara, Stefan Langerman, Erik D. Demaine, Jean Cardinal, Shinji Imahori
Publication date: 17 December 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/62218
Computational aspects related to convexity (52B55) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: Algorithmic Folding Complexity
