Theory and Applications of Satisfiability Testing

DOI10.1007/B95238MaRDI QIDQ5325871zbMATHOpenAlexFDO

Authors Ryan Williams

Publication date 24 July 2009

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

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

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05)

Recommendations

• Theory and Applications of Satisfiability Testing
• An approximation algorithm for \(\#k\)-SAT
• An improved exponential-time algorithm for k -SAT
• Worst-case study of local search for MAX-\(k\)-SAT.
• A Better Algorithm for Random k-SAT

Cited in

(6)

• Theory and Applications of Satisfiability Testing
• An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF
• A CNF Formula Hierarchy over the Hypercube
• On the complexity of equational problems in CNF
• Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs
• On extremal \(k\)-CNF formulas

This page was built for publication: Theory and Applications of Satisfiability Testing

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