On the power of two-point based sampling

Journal of Complexity

Volumn 5, Issue 1, 1989, Pages 96-106

  Chor, Benny ^a   Goldreich, Oded ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002739272     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/0885-064X(89)90015-0     Document Type: Article

References (24)

1. Deterministic simulation of probabilistic constant depth circuits
2. RSA and Rabin functions Certain parts are as hard as the whole
3. Eigenvalues and expanders
4. A fast and simple randomized parallel algorithm for the maximal independent set problem
5. How to generate cryptographically strong sequences of pseudo-random bits
6. Universal classes of hash functions
7. The bit extraction problem or t-resilient functions
8. RSA/Rabin Least Significant Bits are 1/2 + 1/poly(log N) Secure
9. On a sequence of almost deterministic pairwise independent random variables
10. On a set of almost deterministic k-independent random variables
11. A time-randomness tradeoff
12. The complexity of parallel computation on matroids
13. A fast parallel algorithm for the maximal independent set problem
14. Explicit expanders and the Ramanujan conjectures
15. A simple parallel algorithm for the maximal independent set problem
16. How to share a secret
17. A complexity theoretic approach to randomness
18. Provably good pattern generators for random pattern test
19. The complexity of approximate counting
20. Theory and applications of trapdoor functions