Pages that link to "Item:Q5415468"

The following pages link to Linear vs. semidefinite extended formulations (Q5415468):

Displaying 36 items.

• Exponential lower bounds for polytopes in combinatorial optimization (Q2796404) (← links)
• Mixed integer linear programming formulation techniques (Q2808240) (← links)
• The Parity Hamiltonian Cycle Problem in Directed Graphs (Q2835661) (← links)
• Deciding Polyhedrality of Spectrahedra (Q2949514) (← links)
• Extended Formulation Lower Bounds via Hypergraph Coloring (Q2955024) (← links)
• Average Case Polyhedral Complexity of the Maximum Stable Set Problem (Q2969642) (← links)
• Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract) (Q2988848) (← links)
• Tropical lower bound for extended formulations. II. Deficiency graphs of matrices (Q3120460) (← links)
• Mixed states in one spatial dimension: Decompositions and correspondence with nonnegative matrices (Q3298903) (← 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)
• (Q4357533) (← links)
• Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
• Matrices of Bounded Psd Rank are Easy to Detect (Q4577739) (← links)
• The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions (Q4592948) (← links)
• Monotone projection lower bounds from extended formulation lower bounds (Q4602399) (← links)
• A separation between tropical matrix ranks (Q5055609) (← links)
• Regular Matroids Have Polynomial Extension Complexity (Q5076712) (← links)
• Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
• Approximate tensor decompositions: Disappearance of many separations (Q5154281) (← links)
• The Slack Realization Space of a Polytope (Q5194621) (← links)
• Forbidden Vertices (Q5252224) (← links)
• The Complexity of Positive Semidefinite Matrix Factorization (Q5355204) (← links)
• Positive semidefinite rank and nested spectrahedra (Q5375914) (← 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 from communication protocols in output-efficient time (Q5918910) (← links)
• Extended formulations in combinatorial optimization (Q5919994) (← links)
• Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)
• Lifts for Voronoi cells of lattices (Q6050227) (← links)
• Shadows of Newton polytopes (Q6076195) (← links)
• Self-Dual Polyhedral Cones and Their Slack Matrices (Q6116664) (← links)
• Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations (Q6592116) (← links)
• Restricted hidden cardinality constraints in causal models (Q6646300) (← links)