Fetching the paper…
Reading the bibliography…
$\newcommand{\eps}{\varepsilon} $We prove that for any $\eps > 0$ it is $\textsf{NP}$-hard to approximate the non-commutative Grothendieck problem to within a factor $1/2 + \eps$, which matches the approximation ratio of the algorithm of Naor, Regev, and Vidick (STOC'13).
Bol. Soc. Mat. São Paulo
Alexander Grothendieck · 1953
Earlier work this paper cites.
J. Amer. Statist. Assoc
Wassily Hoeffding · 1963
Earlier work this paper cites.
Studia Math
Joram Lindenstrauss and Aleksander Pełczyński · 1968
Earlier work this paper cites.
Israel J. Math
Ronald E. Rietz · 1974
Earlier work this paper cites.
J. Funct. Anal
Gilles Pisier · 1978
Earlier work this paper cites.
Adv. Math
Jean-Louis Krivine · 1979
Earlier work this paper cites.
Unpublished, 1984
Alexander Davie · 1984
Earlier work this paper cites.
Adv. in Math
Uffe Haagerup · 1985
Earlier work this paper cites.
Israel J. Math
Uffe Haagerup · 1987
Earlier work this paper cites.
J. Soviet Math
Boris S. Tsirel’son · 1987
Earlier work this paper cites.
Cambridge Univ. Press, 1990
Roger A. Horn and Charles R. Johnson · 1990
Earlier work this paper cites.
J. Operator Theory
Uffe Haagerup and Takashi Itoh · 1995
Earlier work this paper cites.
Optim. Methods Softw
Yurii Nesterov · 1998
Cited alongside, same era.
Random Structures Algorithms
Uriel Feige and Gideon Schechtman · 2002
Cited alongside, same era.
In Proc. 43rd FOCS
Subhash Khot · 2002
Cited alongside, same era.
SIAM J. Comput
Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan O’Donnell · 2004
Cited alongside, same era.
Theory Probab. Appl
Vidmantas Bentkus · 2005
Cited alongside, same era.
SIAM J. Comput
Noga Alon and Assaf Naor · 2006
Cited alongside, same era.
Mathematika
Subhash Khot and Assaf Naor · 2008
Cited alongside, same era.
Bull. Amer. Math. Soc
Gilles Pisier · 2011
Later among the works it cites.
Bull. Amer. Math. Soc. (N.S.)
Luca Trevisan · 2011
Later among the works it cites.
In Proc. 44th STOC
Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, and Yuan Zhou · 2012
Later among the works it cites.
Comm. Pure Appl. Math
Subhash Khot and Assaf Naor · 2012
Later among the works it cites.
Oxford Univ. Press, 2013
Stéphane Boucheron, Gábor Lugosi, and Pascal Massart · 2013
Later among the works it cites.
Forum Math. Pi
Mark Braverman, Konstantin Makarychev, Yury Makarychev, and Assaf Naor · 2013
Later among the works it cites.
ACM Trans. Comput. Theory
Oded Regev and Thomas Vidick · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Subhash Khot and Ryan O’Donnell · 2009
Cited alongside, same era.
In Proc. 20th ACM-SIAM Symp. on Discrete Algorithms (SODA’09)
Prasad Raghavendra and David Steurer · 2009
Cited alongside, same era.
In Proc. 19th Symp. Mathem. Theory of Networks and Systems (MTNS’10)
Jop Briët, Fernando Mário de Oliveira Filho, and Frank Vallentin · 2010
Cited alongside, same era.
In Proc. 25th IEEE Conf. on Computational Complexity (CCC’10)
Subhash Khot · 2010
Cited alongside, same era.
Math. Oper. Res
Guy Kindler, Assaf Naor, and Gideon Schechtman · 2010
Cited alongside, same era.
Theory of Computing
Assaf Naor, Oded Regev, and Thomas Vidick · 2014
Closest in time.
Cambridge Univ. Press, 2014
Ryan O’Donnell · 2014
Closest in time.
In Proc. 56th FOCS
Jop Briët, Oded Regev, and Rishi Saket · 2015
Closest in time.
Math. Program
Afonso S. Bandeira, Christopher Kennedy, and Amit Singer · 2016
Closest in time.
ACM Trans. Algor
Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, and Yi Wu · 2016
Closest in time.