An Improved SAT Algorithm in Terms of Formula Length

DOI10.1007/978-3-642-03367-4_13zbMATH Open1253.68166OpenAlexW1485462419MaRDI QIDQ3183448FDOQ3183448

Authors: Yang Liu, Jianer 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

Recommendations

• Algorithms – ESA 2005
• Theory and Applications of Satisfiability Testing
• A faster clause-shortening algorithm for SAT with no restriction on clause length
• scientific article; zbMATH DE number 1303594
• scientific article; zbMATH DE number 515744

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A Computing Procedure for Quantification Theory
• Vertex cover: Further observations and further improvements
• Title not available (Why is that?)
• Measure and conquer
• STACS 2005
• New worst-case upper bounds for SAT
• Algorithms – ESA 2005
• A satisfiability tester for non-clausal propositional calculus
• Title not available (Why is that?)
• Theory and Applications of Satisfiability Testing

Cited In (6)

• SAT-Based Formula Simplification
• A fast algorithm for SAT in terms of formula length
• Improvements to Hybrid Incremental SAT Algorithms
• Algorithms – ESA 2005
• An improved upper bound for SAT
• Further improvements for SAT in terms of formula length

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

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