The following pages link to (Q4681889):
Displaying 16 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
- Special issue in memory of Misha Alekhnovich. Foreword (Q430839) (← links)
- Lower bounds for \(k\)-DNF resolution on random 3-CNFs (Q430840) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- Another look at degree lower bounds for polynomial calculus (Q2333803) (← links)
- A Framework for Space Complexity in Algebraic Proof Systems (Q2796410) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- (Q5028363) (← links)
- (Q5092479) (← links)
- Sharp Effective Finite-Field Nullstellensatz (Q6058311) (← links)
- Propositional proof complexity (Q6064569) (← links)
- Perfect matching in random graphs is as hard as Tseitin (Q6562700) (← links)
- Graphs with large girth and chromatic number are hard for Nullstellensatz (Q6573006) (← links)
- Sufficient condition for polynomial solvability of random 3-CNF formulas (Q6644123) (← links)
