Show simple item record

On the complexity of reconfiguration problems

dc.contributor.authorIto, Takehiro
dc.contributor.authorDemaine, Erik D.
dc.contributor.authorHarvey, Nicholas J.A.
dc.contributor.authorPapadimitriou, Christos H.
dc.contributor.authorSideri, Martha
dc.contributor.authorUehara, Ryuhei
dc.contributor.authorUno, Yushi
dc.date.accessioned2015-11-20T18:06:00Z
dc.date.available2015-11-20T18:06:00Z
dc.date.issued2010-12
dc.date.submitted2010-11
dc.identifier.issn03043975
dc.identifier.urihttp://hdl.handle.net/1721.1/99966
dc.description.abstractReconfiguration 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.en_US
dc.language.isoen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.tcs.2010.12.005en_US
dc.rightsCreative Commons Attributionen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/en_US
dc.sourceMIT web domainen_US
dc.titleOn the complexity of reconfiguration problemsen_US
dc.typeArticleen_US
dc.identifier.citationIto, Takehiro, Erik D. Demaine, Nicholas J.A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, and Yushi Uno. “On the Complexity of Reconfiguration Problems.” Theoretical Computer Science 412, no. 12–14 (March 2011): 1054–1065.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.mitauthorDemaine, Erik D.en_US
dc.relation.journalTheoretical Computer Scienceen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsIto, Takehiro; Demaine, Erik D.; Harvey, Nicholas J.A.; Papadimitriou, Christos H.; Sideri, Martha; Uehara, Ryuhei; Uno, Yushien_US
dc.identifier.orcidhttps://orcid.org/0000-0003-3803-5703
mit.licensePUBLISHER_CCen_US
mit.metadata.statusComplete


Files in this item

Thumbnail
Name:
Demaine-On the complexity.pdf
Size:
176.6Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record