Paper by Erik D. Demaine
- Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, and Andrew Winslow, “Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect”, in Proceedings of the 24th International Conference on Computing and Combinatorics (COCOON 2018), Qing Dao, China, July 2–4, 2018, pages 365–377.
- This paper is available as arXiv:1805.04055 and from SpringerLink.
- Currently unavailable. If you are in a rush for copies,
- [Google Scholar search]
- Related papers:
- NAEReconfiguration_TCS (Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect)
See also other papers by Erik Demaine.
These pages are generated automagically from a
Last updated July 21, 2021 by