Guided Search and a Faster Deterministic Algorithm for 3-SAT
From MaRDI portal
Publication:5458517
DOI10.1007/978-3-540-78773-0_6zbMath1136.68521OpenAlexW1488940485MaRDI QIDQ5458517
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
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
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
This page was built for publication: Guided Search and a Faster Deterministic Algorithm for 3-SAT