Author:
Ben-Eliezer Ido,Hod Rani,Lovett Shachar
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Alon, N.: On the density of sets of vectors. Discrete Math. 46, 199–202 (1983)
2. Lecture Notes in Computer Science;N. Alon,2008
3. Ben-Sasson, E., Kopparty, S.: Affine dispersers from subspace polynomials. In: proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), pp. 65–74 (2009)
4. Babai, L., Nisan, N., Szegedy, M.: Multiparty protocols, pseudorandom generators for logspace and time-space trade-offs. J. of Computer and System Sciences 45(2), 204–232 (1992)
5. Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering Codes. North Holland, Amsterdam (1997)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Extractor-based time-space lower bounds for learning;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20
2. The Complexity of DNF of Parities;Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science;2016-01-14