Publications

3 results at Theory of Computing

Tight hardness of the non-commutative grothendieck problem
- - Jop Briët
  - Oded Regev
  - et al.
- 2017
- 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