Pages that link to "Item:Q5415468"
From MaRDI portal
The following pages link to Linear vs. semidefinite extended formulations (Q5415468):
Displayed 33 items.
- Clique-stable set separation in perfect graphs with no balanced skew-partitions (Q267214) (← links)
- Rank functions of tropical matrices (Q269280) (← links)
- Polytopes of minimum positive semidefinite rank (Q377501) (← links)
- Clique versus independent set (Q402465) (← links)
- On the nonnegative rank of distance matrices (Q436566) (← links)
- Smallest compact formulation for the permutahedron (Q745678) (← links)
- Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
- On the extension complexity of combinatorial polytopes (Q745682) (← links)
- On the existence of 0/1 polytopes with high semidefinite extension complexity (Q745683) (← links)
- Uncapacitated flow-based extended formulations (Q745688) (← links)
- Positive semidefinite rank (Q745689) (← links)
- Worst-case results for positive semidefinite rank (Q745690) (← links)
- Lower bounds on the sizes of integer programs without additional variables (Q896270) (← links)
- Simple extensions of polytopes (Q896292) (← links)
- \(k\)-neighborly faces of the Boolean quadric polytopes (Q2259296) (← links)
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation (Q2259297) (← links)
- A short proof that the extension complexity of the correlation polytope grows exponentially (Q2340413) (← links)
- An upper bound for nonnegative rank (Q2341256) (← links)
- A generalization of extension complexity that captures P (Q2345857) (← links)
- The simplest families of polytopes associated with NP-hard problems (Q2353062) (← links)
- Some \(0/1\) polytopes need exponential size extended formulations (Q2434987) (← links)
- A note on the extension complexity of the knapsack polytope (Q2450664) (← links)
- Quantum learning of classical stochastic processes: The completely positive realization problem (Q2786625) (← links)
- A Comprehensive Analysis of Polyhedral Lift-and-Project Methods (Q2790405) (← links)
- Deciding Polyhedrality of Spectrahedra (Q2949514) (← links)
- Query Complexity in Expectation (Q3448835) (← links)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone (Q3457190) (← links)
- Forbidden Vertices (Q5252224) (← links)
- An Almost Optimal Algorithm for Computing Nonnegative Rank (Q5743610) (← links)
- A Polyhedral Characterization of Border Bases (Q5744696) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
- Extended formulations in combinatorial optimization (Q5919994) (← links)