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 50 items.
- Average case polyhedral complexity of the maximum stable set problem (Q344955) (← links)
- Some upper and lower bounds on PSD-rank (Q517316) (← links)
- Positive semidefinite rank (Q745689) (← links)
- Extension complexity of formal languages (Q778518) (← links)
- Lower bounds on the sizes of integer programs without additional variables (Q896270) (← links)
- Sum-of-squares rank upper bounds for matching problems (Q1631641) (← links)
- The matching problem has no small symmetric SDP (Q1675264) (← links)
- Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- Limitations of semidefinite programs for separable states and entangled games (Q1731116) (← links)
- Parameter selection method for support vector regression based on adaptive fusion of the mixed kernel function (Q1794163) (← links)
- Strong reductions for extended formulations (Q1801022) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
- Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
- On derandomized composition of Boolean functions (Q2281253) (← links)
- On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\) (Q2422767) (← links)
- On approximations of the PSD cone by a polynomial number of smaller-sized PSD cones (Q2687062) (← links)
- Two results on the size of spectrahedral descriptions (Q2792406) (← links)
- Exponential lower bounds for polytopes in combinatorial optimization (Q2796404) (← links)
- Sum-of-Squares Rank Upper Bounds for Matching Problems (Q2835696) (← links)
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
- (Q3386630) (← links)
- Query Complexity in Expectation (Q3448835) (← links)
- On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
- Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies (Q3451762) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- Deterministic Communication vs. Partition Number (Q4562279) (← 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)
- On Ranks of Regular Polygons (Q4594484) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- Small extended formulation for knapsack cover inequalities from monotone circuits (Q4612478) (← links)
- Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs (Q4994984) (← links)
- (Q5005186) (← links)
- Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
- (Q5088887) (← links)
- (Q5089260) (← links)
- (Q5090377) (← links)
- (Q5091176) (← links)
- (Q5091238) (← links)
- (Q5091260) (← links)
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- Query-to-Communication Lifting for BPP (Q5117373) (← links)
- (Q5121903) (← links)
- The Slack Realization Space of a Polytope (Q5194621) (← links)
