Pages that link to "Item:Q3304105"
From MaRDI portal
The following pages link to The relation between polynomial calculus, Sherali-Adams, and sum-of-squares proofs (Q3304105):
Displaying 13 items.
- Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- Tight size-degree bounds for sums-of-squares proofs (Q4601842) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- Sherali-adams strikes back (Q5091758) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
- MaxSAT Resolution and Subcube Sums (Q5875950) (← links)
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem (Q6081762) (← links)
- On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (Q6184293) (← links)
- Perfect matching in random graphs is as hard as Tseitin (Q6562700) (← links)
- Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative? (Q6562829) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 12--17, 2023 (Q6613397) (← links)
- First-order reasoning and efficient semi-algebraic proofs (Q6614038) (← links)
