Efficient rounding for the noncommutative grothendieck inequality

Assaf Naor, Oded Regev, Thomas Vidick. Efficient rounding for the noncommutative grothendieck inequality. In Dan Boneh, Tim Roughgarden, Joan Feigenbaum, editors, Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013. pages 71-80, ACM, 2013. [doi]

@inproceedings{NaorRV13,
  title = {Efficient rounding for the noncommutative grothendieck inequality},
  author = {Assaf Naor and Oded Regev and Thomas Vidick},
  year = {2013},
  doi = {10.1145/2488608.2488618},
  url = {http://doi.acm.org/10.1145/2488608.2488618},
  researchr = {https://researchr.org/publication/NaorRV13},
  cites = {0},
  citedby = {0},
  pages = {71-80},
  booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013},
  editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum},
  publisher = {ACM},
  isbn = {978-1-4503-2029-0},
}