Pages that link to "Item:Q5957910"

The following pages link to Complexity of Null- and Positivstellensatz proofs (Q5957910):

Displaying 33 items.

• The strength of multilinear proofs (Q1024659) (← links)
• Algebraic proof systems over formulas. (Q1401356) (← links)
• Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
• Tropical effective primary and dual Nullstellensätze (Q1745195) (← links)
• Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005) (← links)
• Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
• An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
• Hypercontractive inequalities via SOS, and the Frankl-Rödl graph (Q2826231) (← links)
• Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
• On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
• On the Generation of Positivstellensatz Witnesses in Degenerate Cases (Q3088010) (← links)
• Proof Complexity and the Kneser-Lovász Theorem (Q3192060) (← links)
• The relation between polynomial calculus, Sherali-Adams, and sum-of-squares proofs (Q3304105) (← links)
• Limitations of Algebraic Approaches to Graph Isomorphism Testing (Q3448781) (← links)
• On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
• The Null Space Problem I. Complexity (Q3747622) (← links)
• Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
• SOS Is Not Obviously Automatizable, Even Approximately (Q4638114) (← links)
• (Q5005186) (← links)
• (Q5091238) (← links)
• Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
• An Elementary Recursive Bound for Effective Positivstellensatz and Hilbert’s 17th problem (Q5108709) (← links)
• Narrow Proofs May Be Maximally Long (Q5277920) (← links)
• Complexity, exactness, and rationality in polynomial optimization (Q5918421) (← links)
• Complexity, exactness, and rationality in polynomial optimization (Q5925641) (← links)
• Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity (Q5941296) (← links)
• Complexity of Positivstellensatz proofs for the knapsack (Q5957725) (← links)
• Subtraction-free complexity, cluster transformations, and spanning trees (Q5963078) (← links)
• Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem (Q6081762) (← links)
• Sum of Squares Bounds for the Empty Integral Hull Problem (Q6081967) (← 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)