Login / Signup
Tight Hardness of the Non-commutative Grothendieck Problem.
Jop Briët
Oded Regev
Published in:
CoRR (2014)
Keyphrases
</>
worst case
lower bound
upper bound
phase transition
np hard
special case
np complete
learning theory
generalization error bounds
learning algorithm
np hardness
information theoretic
computational complexity
decision trees
optimal solution
randomly generated
computer vision