Computational analogues of entropy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2764, Issue , 2003, Pages 200-215

  Barak, Boaz ^a   Shaltiel, Ronen ^a   Wigderson, Avi ^b,c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTATION THEORY; COMPUTATIONAL METHODS; OPTIMIZATION; RANDOM PROCESSES;

COMPUTATIONAL MODEL; CONSTANT BIAS; DISTINGUISHERS; NATURAL MODELS; PARTICULAR DISTRIBUTION; PSEUDO-RANDOM DISTRIBUTION; RANDOMNESS EXTRACTORS; STATISTICAL MEASURES;

ENTROPY;

EID: 35248890430     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_18     Document Type: Article

References (30)

1. Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences 28 (1984) 270-299 Preliminary version in STOC' 82.
2. Yao, A.C.: Theory and applications of trapdoor functions. In: 23rd FOCS. (1982) 80-91
3. Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing 13 (1984) 850-864
4. Håstad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal on Computing 28 (1999) 1364-1396 (electronic)
5. Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal 27 (1948) 379-423, 623-656
6. Goldberg, A.V., Sipser, M.: Compression and ranking. SIAM Journal on Computing 20 (1991) 524-536
7. von Neumann, J.: Zur theorie der gesellschaftsspiele. Math. Ann. 100 (1928) 295-320
8. Klivans, A.R., van Melkebeek, D.: Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM J. Comput. 31 (2002) 1501-1526 (electronic)
9. Miltersen, P.B., Vinodchandran, N.V.: Derandomizing Arthur-Merlin games using hitting sets. In: 40th FOCS. (1999) 71-80
10. Shaltiel, R., Umans, C.: Simple extractors for all min-entropies and a new pseudo-random generator. In: 42nd FOCS. (2001) 648-657
11. Trevisan, L., Vadhan, S.: Extracting randomness from samplable distributions. In: 41st FOCS. (2000) 32-42
12. Nisan, N.: Extracting randomness: How and why: A survey. In: Conference on Computational Complexity. (1996) 44-58
13. Nisan, Ta-Shma: Extracting randomness: A survey and new constructions. JCSS: Journal of Computer and System Sciences 58 (1999)
14. Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the European Association for Theoretical Computer Science 77 (2002) 67- Also available on http://www.wisdom.weizmann.ac.il/~ronens.
15. Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions. In: 21st STOC. (1989) 12-24
16. Sudan, M., Trevisan, L., Vadhan, S.: Pseudorandom generators without the XOR lemma. JCSS: Journal of Computer and System Sciences 62 (2001) Preliminary version in STOC' 99.
17. Also published as ECCC Report TR98-074.
18. Trevisan, L.: Construction of extractors using pseudo-random generators. In: 31st STOC. (1999) 141-148
19. Raz, R., Reingold, O., Vadhan, S.: Extracting all the randomness and reducing the error in trevisan's extractors. JCSS: Journal of Computer and System Sciences 65 (2002) Preliminary version in STOC' 99.
20. Impagliazzo, R., Shaltiel, R., Wigderson, A.: Extractors and pseudo-random generators with optimal seed length. In ACM, ed.: 32nd STOC. (2000) 1-10
21. Ta-Shma, A., Zuckerman, D., Safra, S.: Extractors from Reed-Muller codes. In IEEE, ed.: 42nd FOCS. (2001) 638-647
22. Babai, L., Fortnow, L., Nisan, N., Wigderson, A.: BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity 3 (1993) 307-318
23. Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In: 29th STOC. (1997) 220-229
24. Nisan, N., Wigderson, A.: Hardness vs. randomness. J. Comput. System Sci. 49 (1994) 149-167
25. Nisan, N.: Pseudorandom generators for space-bounded computations. In ACM, ed.: 22nd STOC. (1990) 204-212
26. Impagliazzo, R., Nisan, N., Wigderson, A.: Pseudorandomness for network algorithms. In ACM, ed.: 26th STOC. (1994) 356-364
27. Bar-Yossef, Z., Reingold, O., Shaltiel, R., Trevisan, L.: Streaming computation of combinatorial objects. In: Conference on Computational Complexity (CCC). Volume 17. (2002)
28. Nisan, N., Zuckerman, D.: Randomness is linear in space. Journal of Computer and System Sciences 52 (1996) 43-52 Preliminary version in STOC' 93.
29. Saks, M.: Randomization and derandomization in space-bounded computation. In: Conference on Computational Complexity (CCC). (1996) 128-149
30. Jerrum, M.R., Valiant, L.G., Vazirani, V.V.: Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science 43 (1986) 169-188