Related references
Note: Only part of the references are listed.A simple proof that the (n2-1)-puzzle is hard
Erik D. Demaine et al.
THEORETICAL COMPUTER SCIENCE (2018)
Complexity of independent set reconfigurability problems
Marcin Kaminski et al.
THEORETICAL COMPUTER SCIENCE (2012)
Finding Paths Between 3-Colorings
Luis Cereceda et al.
JOURNAL OF GRAPH THEORY (2011)
An exact algorithm for the Boolean connectivity problem for k-CNF
Kazuhisa Makino et al.
THEORETICAL COMPUTER SCIENCE (2011)
Shortest paths between shortest paths
Marcin Kaminski et al.
THEORETICAL COMPUTER SCIENCE (2011)
On the complexity of reconfiguration problems
Takehiro Ito et al.
THEORETICAL COMPUTER SCIENCE (2011)
THE CONNECTIVITY OF BOOLEAN SATISFIABILITY: COMPUTATIONAL AND STRUCTURAL DICHOTOMIES
Parikshit Gopalan et al.
SIAM JOURNAL ON COMPUTING (2009)
Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances
Paul Bonsma et al.
THEORETICAL COMPUTER SCIENCE (2009)
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
RA Hearn et al.
THEORETICAL COMPUTER SCIENCE (2005)
Share Paper
