The following pages link to (Q4807964):
Displaying 14 items.
- On the Chvátal rank of the pigeonhole principle (Q1029351) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems (Q1947040) (← links)
- On the complexity of Hilbert refutations for partition (Q2252121) (← links)
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability (Q2446872) (← links)
- Several notes on the power of Gomory-Chvátal cuts (Q2498920) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- (Q3304105) (← links)
- Resolution Width and Cutting Plane Rank Are Incomparable (Q3599159) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- (Q5090427) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts (Q5853720) (← links)
- Propositional proof complexity (Q6064569) (← links)
