Pages that link to "Item:Q2941550"
From MaRDI portal
The following pages link to Lower Bounds on the Size of Semidefinite Programming Relaxations (Q2941550):
Displaying 17 items.
- Certifying Polynomial Nonnegativity via Hyperbolic Optimization (Q5208888) (← links)
- No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
- Covering the Large Spectrum and Generalized Riesz Products (Q5346540) (← links)
- The Complexity of Positive Semidefinite Matrix Factorization (Q5355204) (← links)
- Positive semidefinite rank and nested spectrahedra (Q5375914) (← links)
- Linear vs. semidefinite extended formulations (Q5415468) (← links)
- Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization (Q5742692) (← links)
- An Almost Optimal Algorithm for Computing Nonnegative Rank (Q5743610) (← 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)
- Sum-of-squares hierarchies for binary polynomial optimization (Q5925640) (← links)
- Lifts for Voronoi cells of lattices (Q6050227) (← links)
- Sum of Squares Bounds for the Empty Integral Hull Problem (Q6081967) (← links)
- Complex psd-minimal polytopes in dimensions two and three (Q6089230) (← links)
- Self-Dual Polyhedral Cones and Their Slack Matrices (Q6116664) (← links)
- Perfect matching in random graphs is as hard as Tseitin (Q6562700) (← links)
- Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations (Q6592116) (← links)
