Author:
Sudan Madhu,Trevisan Luca,Vadhan Salil
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference53 articles.
1. L. Adleman, Two theorems on random polynomial time, in 19th Annual Symposium on Foundations of Computer Science, Ann Arbor, Michigan, 16–18 October 1978, pp. 75–83, IEEE Press, New York.
2. Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs;Andreev,1997
3. Reconstructing algebraic functions from mixed data;Ar;SIAM J. Comput,1999
4. S. Arora and M. Sudan, Improved low degree testing and its applications, in Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, El Paso, Texas, 4–6 May 1997, pp. 485–495.
5. On resource-bounded measure and pseudorandomness;Arvind,1997
Cited by
205 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献