Login / Signup
Tight Hardness of the Non-commutative Grothendieck Problem.
Jop Briët
Oded Regev
Rishi Saket
Published in:
FOCS (2015)
Keyphrases
</>
worst case
lower bound
upper bound
phase transition
np hard
computational complexity
learning theory
np complete
database
artificial intelligence
special case
np hardness
pattern recognition
cooperative
information theoretic
face recognition
case study
machine learning