Algorithms and Computation

Volume 5369 of the series Lecture Notes in Computer Science pp 28-39

On the Complexity of Reconfiguration Problems

  • Takehiro ItoAffiliated withGraduate School of Information Sciences, Tohoku University
  • , Erik D. DemaineAffiliated withMIT Computer Science and Artificial Intelligence Laboratory
  • , Nicholas J. A. HarveyAffiliated withMIT Computer Science and Artificial Intelligence Laboratory
  • , Christos H. PapadimitriouAffiliated withComputer Science Division, University of California at Berkeley
  • , Martha SideriAffiliated withDepartment of Computer Science, Athens University of Economics and Business
  • , Ryuhei UeharaAffiliated withSchool of Information Science, JAIST
  • , Yushi UnoAffiliated withGraduate School of Science, Osaka Prefecture University

* Final gross prices may vary according to local VAT.

Get Access


Reconfiguration problems arise when we wish to find a step-by-step transformation between two feasible solutions of a problem such that all intermediate results are also feasible. We demonstrate that a host of reconfiguration problems derived from NP-complete problems are PSPACE-complete, while some are also NP-hard to approximate. In contrast, several reconfiguration versions of problems in P are solvable in polynomial time.