A combinatorial analysis for the critical clause tree

DOI10.1007/s00224-012-9383-6zbMath1298.68291OpenAlexW2032225349MaRDI QIDQ1946495

Masaki Yamamoto

Publication date: 15 April 2013

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-012-9383-6

zbMATH Keywords

\(k\)-SATcritical clause tree

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Solving satisfiability in less than \(2^ n\) steps
• Catalan numbers, their generalization, and their uses
• A full derandomization of schöning's k-SAT algorithm
• 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General

This page was built for publication: A combinatorial analysis for the critical clause tree