An Improved SAT Algorithm in Terms of Formula Length

DOI10.1007/978-3-642-03367-4_13zbMath1253.68166OpenAlexW1485462419MaRDI QIDQ3183448

Yang Liu, Jian'er Chen

Publication date: 20 October 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-03367-4_13

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)

An improved upper bound for SAT ⋮ Further improvements for SAT in terms of formula length ⋮ A fast algorithm for SAT in terms of formula length

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A satisfiability tester for non-clausal propositional calculus
• New worst-case upper bounds for SAT
• Vertex Cover: Further Observations and Further Improvements
• Measure and conquer
• Algorithms – ESA 2005
• A Computing Procedure for Quantification Theory
• STACS 2005
• Theory and Applications of Satisfiability Testing

This page was built for publication: An Improved SAT Algorithm in Terms of Formula Length