Guided Search and a Faster Deterministic Algorithm for 3-SAT

DOI10.1007/978-3-540-78773-0_6zbMath1136.68521OpenAlexW1488940485MaRDI QIDQ5458517

Dominik Scheder

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_6

Mathematics Subject Classification ID

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

Related Items (3)

Derandomizing the HSSW algorithm for 3-SAT ⋮ A new upper bound for \(( n , 3)\)-MAX-SAT ⋮ Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT

Cites Work

• Unnamed Item
• Unnamed Item
• Solving satisfiability in less than \(2^ n\) steps
• A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
• An improved local search algorithm for 3-SAT
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving

This page was built for publication: Guided Search and a Faster Deterministic Algorithm for 3-SAT