Probe Order Backtracking

DOI10.1137/S0097539793256053zbMath0870.68134OpenAlexW2001636851MaRDI QIDQ4337643

G. Neil Haven, Paul Walton jun. Purdom

Publication date: 26 May 1997

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539793256053

zbMATH Keywords

NP-completesatisfiabilitysearchingbacktrackingcombinatorial searchaverage timeAlgorithm for constraint-satisfaction problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Asymptotic enumeration (05A16) Classical propositional logic (03B05)

Related Items (2)

Results related to threshold phenomena research in satisfiability: Lower bounds ⋮ Typical case complexity of satisfiability algorithms and the threshold phenomenon

This page was built for publication: Probe Order Backtracking