ACM Symposium on Theory of Computing, STOC 2016


Article Details
Title: Sparse fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time
Article URLs:
Alternative Article URLs:
Authors: Michael Kapralov
  • EPFL
Sharing: Unknown
Verification: Author has not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/Kapralov16
Author Comments:

Discuss this paper and its artifacts below