Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas

DOI10.1007/978-3-642-14186-7_4zbMath1306.68152OpenAlexW1519724636MaRDI QIDQ4930576

Eli Ben-Sasson, Jan Johannsen

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_4

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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Space Complexity in Polynomial Calculus ⋮ On CDCL-Based Proof Systems with the Ordered Decision Strategy

This page was built for publication: Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas