Pages that link to "Item:Q4638114"
From MaRDI portal
The following pages link to SOS Is Not Obviously Automatizable, Even Approximately (Q4638114):
Displaying 23 items.
- Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
- Lift \& project systems performing on the partial-vertex-cover polytope (Q1989348) (← links)
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
- A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian (Q2235162) (← links)
- A simplified treatment of Ramana's exact dual for semidefinite programming (Q2688906) (← links)
- Disordered systems insights on computational hardness (Q5055432) (← links)
- (Q5089174) (← links)
- (Q5090427) (← links)
- Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism (Q5096588) (← links)
- High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts (Q5853720) (← links)
- Sum-of-squares hierarchies for binary polynomial optimization (Q5918420) (← links)
- Complexity, exactness, and rationality in polynomial optimization (Q5918421) (← links)
- Sum-of-squares hierarchies for binary polynomial optimization (Q5925640) (← links)
- Complexity, exactness, and rationality in polynomial optimization (Q5925641) (← links)
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem (Q6081762) (← links)
- A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization (Q6081938) (← links)
- The Spectrum of the Grigoriev–Laurent Pseudomoments (Q6187076) (← links)
- How Do Exponential Size Solutions Arise in Semidefinite Programming? (Q6195320) (← links)
- Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative? (Q6562829) (← links)
- On classifying continuous constraint satisfaction problems (Q6566470) (← links)
- The moment-SOS hierarchy: applications and related topics (Q6598421) (← links)
- First-order reasoning and efficient semi-algebraic proofs (Q6614038) (← links)
- Gaussian mixtures closest to a given measure via optimal transport (Q6639473) (← links)