Average case results for satisfiability algorithms under the random-clause-width model

DOI10.1023/A:1018992730285zbMATH Open0880.68059OpenAlexW1509986590MaRDI QIDQ1370606

R. P. Swaminathan, John V. Franco

Publication date: 26 October 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018992730285

zbMATH Keywords

satisfiability problemrandom-clause-width model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (5)

Local search algorithms for SAT: Worst-case analysis ⋮ Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances ⋮ On Average Case Complexity of SAT for Symmetric Distribution ⋮ Computer Science Logic ⋮ An average analysis of backtracking on random constraint satisfaction problems

This page was built for publication: Average case results for satisfiability algorithms under the random-clause-width model

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