Publisher
Springer Science and Business Media LLC
Reference4 articles.
1. Hugo Akitaya, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, and Tomohiro Tachi. Rigid foldability is NP-hard. J. Comput. Geom. 11:1 (2020), 93–124.
2. Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, and Ryuhei Uehara. Box pleating is hard. In Discrete Comput. Geom. Graphs: 18th Japan Conf, JCDCGG 2015, Kyoto, Japan, September 14–16, 2015, pp. 167–179. Springer, 2016.
3. Thomas C. Hull. Solving cubics with creases: the work of Beloch and Lill. Amer. Math. Monthly 118:4 (2011), 307–315.
4. Thomas C. Hull and Inna Zakharevich. Flat origami is Turing complete. arXiv:2309.07932, 2023.