Paper by Erik D. Demaine

Reference:

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.

Comments:

This paper is available as arXiv:1805.04055 and from SpringerLink.

Availability:

Currently unavailable. If you are in a rush for copies, contact me.

[Google Scholar search]

Related papers:

NAEReconfiguration_TCS (Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect)