Backtracking with multi-level dynamic search rearrangement
From MaRDI portal
Publication:1138385
DOI10.1007/BF00288958zbMath0431.68066MaRDI QIDQ1138385
Edward L. Robertson, Cynthia A. Brown, Paul Walton jun. Purdom
Publication date: 1981
Published in: Acta Informatica (Search for Journal in Brave)
backtracking; backtrack tree; multi-level dynamic search; search order; search rearrangement algorithm
68Q25: Analysis of algorithms and problem complexity
68R99: Discrete mathematics in relation to computer science
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for combinatorial problems
- Mathematics and Computer Science: Coping with Finiteness
- An Average Time Analysis of Backtracking
- Estimating the Efficiency of Backtrack Programs
- Backtrack programming techniques
- Tree Size by Partial Backtracking
- The complexity of satisfiability problems
- A Computing Procedure for Quantification Theory
- The complexity of theorem-proving procedures