Exponential Lower Bounds for Refuting Random Formulas Using Ordered Binary Decision Diagrams

DOI10.1007/978-3-642-38536-0_11zbMath1382.68088OpenAlexW131902392MaRDI QIDQ4928478

Yixin Xu, Luke Friedman

Publication date: 14 June 2013

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38536-0_11

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)

Related Items (1)

ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES

This page was built for publication: Exponential Lower Bounds for Refuting Random Formulas Using Ordered Binary Decision Diagrams