Journal of the ACM (JACM)
Backtrack programming techniques
Communications of the ACM
A program to solve the Pentomino problem by the recursive use of macros
Communications of the ACM
Construction through decomposition: a divide-and-conquer algorithm for the N-queens problem
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
The complexity of searching several classes of AND/OR graphs
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
In this paper, we study the complexity of finding an efficient search for combinatorial problems which are commonly solved by backtracking. First, a formalism is introduced. Backtrack searches are ordinarily thought of as following a tree pattern. Our model is considerably more general, and there are problems where this allows much shorter searches.Next, we look at the complexity of search strategies (probabilistic decision trees) that can solve any problem in a collection of problems. Let C be the collection of problems that can be solved by a (possibly lucky) search involving K or fewer queries. We prove a nonpolynomial lower bound (in terms of K) on any search strategy for C. We conjecture that a matching upper bound exists.Finally, a few heuristics are presented that give the flavor of an interesting line of research: to test the effectiveness of a heuristic that should work on any problem, try it out on a few specific problems of known complexity. On some simple problems, our heuristics allow polynomial-time searches.