Pages that link to "Item:Q626686"
From MaRDI portal
The following pages link to Random CNF's are hard for the polynomial calculus (Q626686):
Displaying 15 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Algebraic proofs over noncommutative formulas (Q642520) (← links)
- Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- A framework for space complexity in algebraic proof systems (Q2796410) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds (Q4601843) (← links)
- (Q4625701) (← links)
- (Q4625702) (← links)
- Size, cost and capacity: a semantic technique for hard random QBFs (Q4993272) (← links)
- (Q5028438) (← links)
- Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793) (← links)
- Linear gaps between degrees for the polynomial calculus modulo distinct primes (Q5943090) (← links)
- Sharp Effective Finite-Field Nullstellensatz (Q6058311) (← links)
- Propositional proof complexity (Q6064569) (← links)