Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas
From MaRDI portal
Recommendations
- An Exponential Lower Bound for Width-Restricted Clause Learning
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- scientific article; zbMATH DE number 522871
- Query learning of bounded-width OBDDs
- Query learning of bounded-width OBDDs
- On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width
- On the expressive power of CNF formulas of bounded tree- and clique-width
- A stronger LP bound for formula size lower bounds via clique constraints
- A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
Cited in
(7)- Limitations of restricted branching in clause learning
- Space complexity in polynomial calculus
- Limitations of Restricted Branching in Clause Learning
- An Exponential Lower Bound for Width-Restricted Clause Learning
- On CDCL-Based Proof Systems with the Ordered Decision Strategy
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
This page was built for publication: Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4930576)