Theory and Applications of Satisfiability Testing

DOI10.1007/11527695zbMATH Open1122.68591OpenAlexW2483910514MaRDI QIDQ5714775FDOQ5714775

Authors: E. Ya. Dantsin, Alexander Wolpert 

Publication date: 16 December 2005

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

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

Recommendations

• A full derandomization of Schöning's \(k\)-\textsc{SAT} algorithm
• Theory and Applications of Satisfiability Testing
• A faster clause-shortening algorithm for SAT with no restriction on clause length
• Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
• STACS 2004

Mathematics Subject Classification ID

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

Cited In (5)

• An algorithm for exact satisfiability analysed with the number of clauses as parameter
• A faster clause-shortening algorithm for SAT with no restriction on clause length
• On converting CNF to DNF
• An improved upper bound for SAT
• A full derandomization of Schöning's \(k\)-\textsc{SAT} algorithm

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 Q5714775)