Sparse fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Michael Kapralov. Sparse fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time. In Daniel Wichs, Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016. pages 264-277, ACM, 2016. [doi]

This author has not been identified. Look up 'Michael Kapralov' in Google

runs on WebDSL