Explicit, almost optimal, epsilon-balanced codes - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Amnon Ta-Shma. Explicit, almost optimal, epsilon-balanced codes. In Hamed Hatami, Pierre McKenzie, Valerie King, editors, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. pages 238-251, ACM, 2017. [doi]

This author has not been identified. Look up 'Amnon Ta-Shma' in Google

runs on WebDSL