Pages that link to "Item:Q4962201"
From MaRDI portal
The following pages link to Bypassing UGC from Some Optimal Geometric Inapproximability Results (Q4962201):
Displaying 6 items.
- The \(\ell^p\)-Gaussian-Grothendieck problem with vector spins (Q2149938) (← links)
- Grothendieck-Type Inequalities in Combinatorial Optimization (Q2892967) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- (Q5075765) (← links)
- A Greedy Algorithm for Subspace Approximation Problem (Q5116494) (← links)
- Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms (Q5885598) (← links)
