The following pages link to (Q4807964):
Displaying 24 items.
- On the Chvátal rank of the pigeonhole principle (Q1029351) (← links)
- Complexity of computing the local dimension of a semialgebraic set (Q1300630) (← links)
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← 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)
- The relation between polynomial calculus, Sherali-Adams, and sum-of-squares proofs (Q3304105) (← links)
- Resolution Width and Cutting Plane Rank Are Incomparable (Q3599159) (← links)
- Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness (Q4598235) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- (Q4736859) (← links)
- (Q5090427) (← links)
- Semialgebraic Proofs and Efficient Algorithm Design (Q5215904) (← 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)
- Complexity of Null- and Positivstellensatz proofs (Q5957910) (← links)
- The power of the binary value principle (Q6057309) (← links)
- Propositional proof complexity (Q6064569) (← links)
- (Q6076229) (← links)
- Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative? (Q6562829) (← links)
- First-order reasoning and efficient semi-algebraic proofs (Q6614038) (← links)
