Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Efficient rounding for the noncommutative grothendieck inequality
Assaf Naor
, Oded Regev
, Thomas Vidick
Research output
:
Contribution to journal
›
Article
›
peer-review
8
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Efficient rounding for the noncommutative grothendieck inequality'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Grothendieck Inequality
100%
Noncommutative
100%
Polynomial Time
33%
Optimization Problem
33%
Approximation Algorithms
33%
Constant-factor Approximation Algorithm
33%
Robust Principal Component Analysis
33%
Cut Norm
33%
Frieze
33%
Orthogonal Procrustes Problem
33%
NP-hard Optimization Problem
33%
Rounding Procedures
33%
Mathematics
Grothendieck
100%
Rounding
100%
Polynomial Time
33%
Main Result
33%
Principal Component Analysis
33%
Constant Factor
33%
Rounding Procedure
33%