Probe Order Backtracking

DOI10.1137/S0097539793256053zbMATH Open0870.68134OpenAlexW2001636851MaRDI QIDQ4337643FDOQ4337643

Paul Walton jun. Purdom, G. Neil Haven

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-completesatisfiabilitybacktrackingcombinatorial searchsearchingaverage timeAlgorithm for constraint-satisfaction problems

Mathematics Subject Classification ID

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

Cited In (3)

• Typical case complexity of satisfiability algorithms and the threshold phenomenon
• Results related to threshold phenomena research in satisfiability: Lower bounds
• Average Time Analysis of Clause Order Backtracking

   Recommendations

• Title not available (Why is that?) 👍 👎
• Average Time Analysis of Clause Order Backtracking 👍 👎
• Backtracking and random constraint satisfaction 👍 👎
• Polynomial-average-time satisfiability problems 👍 👎

This page was built for publication: Probe Order Backtracking

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