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

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

Show other versions (1)

© 2018, Springer International Publishing AG, part of Springer Nature. We consider the computational complexity of reconfiguration problems, in which one is given two combinatorial configurations satisfying some constraints, and is asked to transform one into the other using elementary transformatio...

Full description

Bibliographic Details
Main Authors: Cardinal, Jean, Demaine, Erik D., Eppstein, David, Hearn, Robert A., Winslow, Andrew
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:English
Published: Springer International Publishing 2021
Online Access:https://hdl.handle.net/1721.1/137759

Internet

https://hdl.handle.net/1721.1/137759

Similar Items