Local search algorithms for SAT: Worst-case analysis

DOI10.1007/BFb0054372zbMath1502.68270OpenAlexW1549979730MaRDI QIDQ5054860

Edward A. Hirsch

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'98 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Solving satisfiability in less than \(2^ n\) steps
• On the greedy algorithm for satisfiability
• Average case results for satisfiability algorithms under the random-clause-width model
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Local search algorithms for SAT: Worst-case analysis