Pages that link to "Item:Q1019183"
From MaRDI portal
The following pages link to Tight rank lower bounds for the Sherali-Adams proof system (Q1019183):
Displaying 9 items.
- Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) (← links)
- On the Chvátal rank of the pigeonhole principle (Q1029351) (← links)
- Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems (Q1947040) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- The relation between polynomial calculus, Sherali-Adams, and sum-of-squares proofs (Q3304105) (← links)
- Resolution Width and Cutting Plane Rank Are Incomparable (Q3599159) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- Proof complexity and the binary encoding of combinatorial principles (Q6562831) (← links)