Sign In

Communications of the ACM

Research Archive


The Research archive provides access to all Research articles published in past issues of Communications of the ACM.

October 2014

From Communications of the ACM

Technical Perspective: Attacking a Problem from the Middle

"Dissection: A New Paradigm for Solving Bicomposite Search Problems," by Itai Dinur, Orr Dunkelman, Nathan Keller, and Adi Shamir, presents an elegant new algorithm for solving a broad class of combinatorial optimization problems…

From Communications of the ACM

Dissection: A New Paradigm For Solving Bicomposite Search Problems


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.