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”, Theoretical Computer Science, volume 806, number 2, February 2020, pages 332–343.

Comments:

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

Availability:

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

[Google Scholar search]

Related papers:

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