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”, Theoretical Computer Science, volume 806, number 2, February 2020, pages 332–343.
- This paper is available as arXiv:1805.04055 and from ScienceDirect.
- Currently unavailable. If you are in a rush for copies,
- [Google Scholar search]
- Related papers:
- NAEReconfiguration_COCOON2018 (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 February 10, 2020 by