Dissection with the Fewest Pieces is Hard, Even to Approximate

Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, Anak Yodpinyanee. Dissection with the Fewest Pieces is Hard, Even to Approximate. In Jin Akiyama, Hiro Ito, Toshinori Sakai, editors, Discrete and Computational Geometry and Graphs - 18th Japan Conference, JCDCGG 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected Papers. Volume 9943 of Lecture Notes in Computer Science, pages 37-48, Springer, 2015. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.