The UGC Hardness Threshold of theLpGrothendieck Problem-Reference-Cited by-同舟云学术

The UGC Hardness Threshold of theLpGrothendieck Problem

Published:2010-05 Issue:2 Volume:35 Page:267-283
ISSN:0364-765X
Container-title:Mathematics of Operations Research
language:en
Short-container-title:Mathematics of OR

Author:

Kindler Guy,Naor Assaf,Schechtman Gideon

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications,General Mathematics

Link

https://pubsonline.informs.org/doi/pdf/10.1287/moor.1090.0425

Reference35 articles.

1. Rigorous location of phase transitions in hard optimization problems

2. The Grothendieck constant of random and pseudo-random graphs

3. Approximating the Cut-Norm via Grothendieck's Inequality

4. Quadratic forms on graphs

5. Arora S., Berger E., Kindler G., Hazan E., Safra S. On non-approximability for quadratic programsProc. 46th Annual Sympos. Foundations Comput. Sci.(2005) IEEE Computer Society206215

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Note on the Hausdorff Distance Between Norm Balls and Their Linear Maps;Set-Valued and Variational Analysis;2023-09

2. Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms;SIAM Journal on Computing;2023-02-14

3. The ℓp-Gaussian-Grothendieck problem with vector spins;Electronic Journal of Probability;2022-01-01

4. On ℓp-Gaussian–Grothendieck Problem;International Mathematics Research Notices;2021-11-11

5. Grothendieck constant is norm of Strassen matrix multiplication tensor;Numerische Mathematik;2019-08-22