The following pages link to (Q3002781):
Displaying 13 items.
- Special issue in memory of Misha Alekhnovich. Foreword (Q430839) (← links)
- Finding a tree structure in a resolution proof is NP-complete (Q1019749) (← links)
- Characterizing Tseitin-formulas with short regular resolution refutations (Q2118291) (← links)
- Expansion-based QBF solving versus Q-resolution (Q2339467) (← links)
- On Q-Resolution and CDCL QBF Solving (Q2818030) (← links)
- Regular and General Resolution: An Improved Separation (Q3502715) (← links)
- An Exponential Lower Bound for Width-Restricted Clause Learning (Q3637163) (← links)
- On Exponential Lower Bounds for Partially Ordered Resolution (Q5015597) (← links)
- On Linear Resolution (Q5015599) (← links)
- A Logical Autobiography (Q5027230) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- Characterizing Tseitin-Formulas with Short Regular Resolution Refutations (Q5881799) (← links)
- Regular resolution effectively simulates resolution (Q6551714) (← links)