Pages that link to "Item:Q4601843"
From MaRDI portal
The following pages link to A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds (Q4601843):
Displaying 11 items.
- Lower bounds for the polynomial calculus (Q1293358) (← links)
- Degree complexity for a modified pigeonhole principle (Q1407601) (← links)
- Another look at degree lower bounds for polynomial calculus (Q2333803) (← links)
- Resolution over linear equations modulo two (Q2334112) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- (Q4464663) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← 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)
- Practical algebraic calculus and Nullstellensatz with the checkers Pacheck and Pastèque and Nuss-Checker (Q6661748) (← links)