Pages that link to "Item:Q5941296"
From MaRDI portal
The following pages link to Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity (Q5941296):
Displayed 39 items.
- On space and depth in resolution (Q1616620) (← links)
- Sum-of-squares rank upper bounds for matching problems (Q1631641) (← links)
- The matching problem has no small symmetric SDP (Q1675264) (← links)
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (Q1683679) (← links)
- Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
- Limitations of semidefinite programs for separable states and entangled games (Q1731116) (← links)
- Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs (Q1983330) (← links)
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
- Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
- Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
- Efficient algorithms for privately releasing marginals via convex relaxations (Q2349860) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- Sum-of-Squares Rank Upper Bounds for Matching Problems (Q2835696) (← links)
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
- Limitations of Algebraic Approaches to Graph Isomorphism Testing (Q3448781) (← links)
- On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
- A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem (Q3452846) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- (Q5009502) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- Disordered systems insights on computational hardness (Q5055432) (← links)
- (Q5090382) (← links)
- (Q5090427) (← links)
- (Q5090440) (← links)
- Sherali-adams strikes back (Q5091758) (← links)
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- (Q5158503) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- Complexity of Null- and Positivstellensatz proofs (Q5957910) (← links)
- Propositional proof complexity (Q6064569) (← links)
- Sum of Squares Bounds for the Empty Integral Hull Problem (Q6081967) (← links)
- Pseudorandom sets in Grassmann graph have near-perfect expansion (Q6101019) (← links)
- Circular (Yet Sound) Proofs in Propositional Logic (Q6116357) (← links)
- (Q6176154) (← links)
- The Spectrum of the Grigoriev–Laurent Pseudomoments (Q6187076) (← links)