ACM Symposium on Theory of Computing, STOC 2018

Article Details
Title: Tight query complexity lower bounds for PCA via finite sample deformed wigner law
Article URLs:
Alternative Article URLs:
Authors: Max Simchowitz
  • U.C Berkeley
Ahmed El Alaoui
  • U.C Berkeley
Benjamin Recht
  • U.C Berkeley
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/SimchowitzAR18
Author Comments:

Discuss this paper and its artifacts below