Author:
Andreev Alexander E.,Clementi Andrea E. F.,Rolim José D. P.
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Andreev A. (1995), “The complexity of nondeterministic functions”, Information and Computation, to appear.
2. Andreev A., Clementi A., and Rolim J. (1996), “Optimal Bounds on the Approximation of Boolean Functions, with Consequences on the Concept of Hardness”, XIII Annual Symposium on Theoretical Aspects of Computer Science (STACS'96), LNCS, 1046, 319–329. Also available via WWW in the electronic journal ECCC (TR95-041).
3. Andreev A., Clementi A., and Rolim J. (1996), “Hitting Sets Derandomize BPP” (full version), submitted. Also available via WWW in the electronic journal ECCC (TR95-061).
4. Blum M., and Micali S. (1984), “How to generate cryptographically strong sequences of pseudorandom bits”, SIAM J. of Computing, 13(4), 850–864.
5. Chor B., and O. Goldreich (1989), “On the Power of Two-Point Based Sampling”, J. of Complexity, 5, 96–106.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Certified Hardness vs. Randomness for Log-Space;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Polynomial Asymptotically Optimal Coding of Underdetermined Bernoulli Sources of the General Form;Problems of Information Transmission;2020-12
3. Simplified Derandomization of BPP Using a Hitting Set Generator;Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation;2011
4. On pseudorandomness and resource-bounded measure;Theoretical Computer Science;2001-03
5. Minimal approximate hitting sets and rule templates;International Journal of Approximate Reasoning;2000-10