Dissection: A new paradigm for solving bicomposite search problems

Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


Combinatorial search problems are usually described by a collection of possible states, a list of possible actions which map each current state into some next state, and a pair of initial and final states. The algorithmic problem is to find a sequence of actions which maps the given initial state into the desired final state. In this paper, we introduce the new notion of bicomposite search problems, and show that they can be solved with improved combinations of time and space complexities by using a new algorithmic paradigm called dissection. To demonstrate the broad applicability of our new paradigm, we show how to use it in order to untangle Rubik's cube and to solve a typical NP-complete partition problem with algorithms which are better than any previously described algorithm for these problems.

Original languageEnglish
Pages (from-to)98-105
Number of pages8
JournalCommunications of the ACM
Issue number10
StatePublished - 23 Sep 2014

Bibliographical note

Publisher Copyright:
© 2014 ACM 0001-0782/14/10 $15.00.


Dive into the research topics of 'Dissection: A new paradigm for solving bicomposite search problems'. Together they form a unique fingerprint.

Cite this