Tight hardness of the non-commutative grothendieck problem
- Jop Briët
- Oded Regev
- et al.
- 2017
- Theory of Computing
Publications
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.
Date
Featured collections
Popular topics
3 results at Theory of Computing
Pseudorandomness and fourier-growth bounds for width-3 branching programs
- Thomas Steinke
- Salil Vadhan
- et al.
- 2017
- Theory of Computing
A non-linear time lower bound for boolean branching programs
- Miklós Ajtai
- 2005
- Theory of Computing