Dissection: A New Paradigm for Solving Bicomposite Search Problems.

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 in...

Descripción completa

Detalles Bibliográficos

Publicado en:	Communications of the ACM Vol. 57; no. 10; pp. 98 - 106
Autores principales:	Dinur, Itai, Dunkelman, Orr, Keller, Nathan, Shamir, Adi
Formato:	Artículo
Publicado:	Association for Computing Machinery Oct2014
Materias:	Combinatorics Search algorithms Spacetime Rubik's Cube Cryptography Boolean functions Computational complexity Mathematical variables
Acceso en línea:	Ver este registro en EBSCOhost