On the complexity of reconfiguration problems

Takehiro Ito, Erik D. Demaine, Nicholas J.A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno

研究成果: Conference contribution

10 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルAlgorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings
ページ28-39
ページ数12
DOI
出版ステータスPublished - 2008
イベント19th International Symposium on Algorithms and Computation, ISAAC 2008 - Gold Coast, QLD, Australia
継続期間: 2008 12 152008 12 17

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5369 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other19th International Symposium on Algorithms and Computation, ISAAC 2008
国/地域Australia
CityGold Coast, QLD
Period08/12/1508/12/17

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「On the complexity of reconfiguration problems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル