Separation between Walksat and DPLL

DOI10.1007/978-981-95-4839-2_8MaRDI QIDQ7290066zbMATH OpenFDO

Authors Shaowei Cai, Ziqun Li, Jiabao Lin, Yijia Chen, Tao Jiang

Publication date 6 July 2026

Full work available at URL https://doi.org/10.1007/978-981-95-4839-2_8

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A machine program for theorem-proving
• Automata, Languages and Programming
• Blocked clause elimination
• Bounded model checking using satisfiability solving
• CCAnr: a configuration checking based local search solver for non-random satisfiability
• CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
• Characterizing Tseitin-Formulas with Short Regular Resolution Refutations
• Collisions Among Random Walks on a Graph
• Graph minors. II. Algorithmic aspects of tree-width
• Handbook of satisfiability. In 2 parts
• Hard examples for resolution
• scientific article; zbMATH DE number 3325539 (Why is no real title available?)
• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
• Satisfiable Tseitin formulas are hard for nondeterministic read-once branching programs
• Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
• Theory and Applications of Satisfiability Testing
• Tight bounds for tseitin formulas
• Toward verifying nonlinear integer arithmetic
• Towards a complexity-theoretic understanding of restarts in SAT solvers
• XOR local search for Boolean Brent equations

This page was built for publication: Separation between Walksat and DPLL

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