Backtracking with multi-level dynamic search rearrangement

DOI10.1007/BF00288958zbMath0431.68066OpenAlexW2037712946MaRDI QIDQ1138385

Edward L. Robertson, Cynthia A. Brown, Paul Walton jun. Purdom

Publication date: 1981

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00288958

zbMATH Keywords

backtrackingbacktrack treemulti-level dynamic searchsearch ordersearch rearrangement algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items (1)

Experimental evaluation of preprocessing algorithms for constraint satisfaction problems

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

This page was built for publication: Backtracking with multi-level dynamic search rearrangement