Pages that link to "Item:Q5415468"
From MaRDI portal
The following pages link to Linear vs. semidefinite extended formulations (Q5415468):
Displaying 50 items.
- Clique-stable set separation in perfect graphs with no balanced skew-partitions (Q267214) (← links)
- Rank functions of tropical matrices (Q269280) (← links)
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- Global completability with applications to self-consistent quantum tomography (Q329581) (← links)
- Extended formulations for independence polytopes of regular matroids (Q343749) (← links)
- Common information and unique disjointness (Q343843) (← links)
- Average case polyhedral complexity of the maximum stable set problem (Q344955) (← links)
- Polytopes of minimum positive semidefinite rank (Q377501) (← links)
- Clique versus independent set (Q402465) (← links)
- On the nonnegative rank of distance matrices (Q436566) (← links)
- Cutting planes from extended LP formulations (Q507316) (← links)
- On the linear extension complexity of regular \(n\)-gons (Q513256) (← links)
- On the \({\mathcal {H}}\)-free extension complexity of the TSP (Q519756) (← 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)
- The matching problem has no small symmetric SDP (Q1675264) (← links)
- The parity Hamiltonian cycle problem (Q1690220) (← links)
- Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780) (← links)
- Decomposition techniques applied to the clique-stable set separation problem (Q1709553) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- Rational and real positive semidefinite rank can be different (Q1785467) (← links)
- Algorithms for positive semidefinite factorization (Q1790680) (← links)
- Strong reductions for extended formulations (Q1801022) (← links)
- Factoring a band matrix over a semiring (Q2041261) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- A variational principle for ground spaces (Q2194218) (← links)
- On \(\epsilon\)-sensitive monotone computations (Q2198153) (← links)
- Lifts of non-compact convex sets and cone factorizations (Q2220437) (← links)
- Nonnegative rank depends on the field (Q2227545) (← 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)
- Extended formulations for radial cones (Q2294359) (← 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)
- The rectangle covering number of random Boolean matrices (Q2363099) (← links)
- Some \(0/1\) polytopes need exponential size extended formulations (Q2434987) (← links)
- A note on the extension complexity of the knapsack polytope (Q2450664) (← links)
- Polynomial size IP formulations of knapsack may require exponentially large coefficients (Q2661530) (← 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)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
