Polynomials, Quantum Query Complexity, and Grothendieck's Inequality

Andris Ambainis. Polynomials, Quantum Query Complexity, and Grothendieck's Inequality. Electronic Colloquium on Computational Complexity (ECCC), 22:196, 2015. [doi]

@article{Ambainis15,
  title = {Polynomials, Quantum Query Complexity, and Grothendieck's Inequality},
  author = {Andris Ambainis},
  year = {2015},
  url = {http://eccc.hpi-web.de/report/2015/196},
  researchr = {https://researchr.org/publication/Ambainis15},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {22},
  pages = {196},
}