Backtracking with multi-level dynamic search rearrangement
- 1 June 1981
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 15 (2) , 99-113
- https://doi.org/10.1007/bf00288958
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Tree Size by Partial BacktrackingSIAM Journal on Computing, 1978
- The complexity of satisfiability problemsPublished by Association for Computing Machinery (ACM) ,1978
- Mathematics and Computer Science: Coping with FinitenessScience, 1976
- Backtrack programming techniquesCommunications of the ACM, 1975
- Estimating the Efficiency of Backtrack ProgramsMathematics of Computation, 1975
- Computer investigation of orthogonal Latin squares of order tenProceedings of Symposia in Applied Mathematics, 1963
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960
- Machine attacks on problems whose variables are permutationsProceedings of Symposia in Applied Mathematics, 1956