Paper by Erik D. Demaine
- Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, and Anak Yodpinyanee, “k-piece dissection is NP-hard”, in Abstracts from the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015), Kyoto, Japan, September 14–16, 2015, to appear.
- The abstract is available in PDF (149k).
- See information on file formats.
- [Google Scholar search]
- Related papers:
- Dissection_JCDCGG2015full (Dissection with the Fewest Pieces is Hard, Even to Approximate)
See also other papers by Erik Demaine.
These pages are generated automagically from a
Last updated October 17, 2021 by