Non uniform selection of solutions for upper bounding the 3-SAT threshold

DOI10.1007/978-3-642-14186-7_10MaRDI QIDQ4930582zbMATH OpenOpenAlexFDO

Authors Yacine Boufkhad, Thomas Hugel

Publication date 29 September 2010

Published in Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14186-7_10

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 2159650
• A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae
• Super solutions of random \((3 + p)\)-SAT
• The unsatisfiability threshold revisited
• Bounding the unsatisfiability threshold of random 3-SAT

Cited in

(2)

• Bounding the unsatisfiability threshold of random 3-SAT
• Estimating satisfiability

This page was built for publication: Non uniform selection of solutions for upper bounding the 3-SAT threshold

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