Pages that link to "Item:Q2946621"
From MaRDI portal
The following pages link to Optimality of size-degree tradeoffs for polynomial calculus (Q2946621):
Displaying 11 items.
- Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
- A note about \(k\)-DNF resolution (Q1641156) (← links)
- On the automatizability of polynomial calculus (Q1959382) (← links)
- Another look at degree lower bounds for polynomial calculus (Q2333803) (← links)
- A Framework for Space Complexity in Algebraic Proof Systems (Q2796410) (← links)
- Automatizability and Simple Stochastic Games (Q3012836) (← links)
- On Linear Resolution (Q5015599) (← links)
- Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
- Sum of squares bounds for the ordering principle (Q5092489) (← links)
- On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (Q6184293) (← links)
