Backtracking with multi-level dynamic search rearrangement

DOI10.1007/BF00288958MaRDI QIDQ1138385zbMATH OpenOpenAlexFDO

Authors Cynthia A. Brown, Edward L. Robertson, 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)

Cites work

• scientific article; zbMATH DE number 3118776 (Why is no real title available?)
• scientific article; zbMATH DE number 3200113 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• An Average Time Analysis of Backtracking
• Approximation algorithms for combinatorial problems
• Backtrack programming techniques
• Estimating the Efficiency of Backtrack Programs
• Mathematics and computer science: coping with finiteness
• The complexity of satisfiability problems
• The complexity of theorem-proving procedures
• Tree Size by Partial Backtracking

Cited in

(1)

• Experimental evaluation of preprocessing algorithms for constraint satisfaction problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1138385)