Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference58 articles.
1. Computational Complexity: A Modern Approach;Arora,2009
2. Maximally efficient two-stage group testing;Berger;Biometrics,2000
3. Pairwise testing;Blass;Bulletin of the EATCS,2002
4. J. Buresh-Oppenheim, V. Kabanets, R. Santhanam, Uniform hardness amplification in NP via monotone codes, 2006, ECCC Technical Report TR06-154.
5. M. Capalbo, O. Reingold, S. Vadhan, A. Wigderson, Randomness conductors and constant-degree expansion beyond the degree/2 barrier, 2002, in: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC, pp. 659–668.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献