Small-bias spaces for group products

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

Volumn 5687 LNCS, Issue , 2009, Pages 658-672

  Meka, Raghu ^a   Zuckerman, David ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABELIAN GROUP; BRANCHING PROGRAMS; CODING THEORY; COMPLEXITY THEORY; DERANDOMIZATION; FINITE GROUPS; LINEAR FUNCTIONS; OPEN PROBLEMS; PSEUDORANDOM GENERATORS; SOLVABLE GROUP;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; COMPUTER PROGRAMMING; GROUP TECHNOLOGY; INFORMATION THEORY; TECHNICAL PRESENTATIONS;

APPROXIMATION ALGORITHMS;

EID: 70350616788     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03685-9_49     Document Type: Conference Paper

References (20)

1. [AGHP92] Alon, N., Goldreich, O., Håstad, J., Peralta, R.: Simple construction of almost k-wise independent random variables. Random Struct. Algorithms 3(3), 289-304 (1992)
2. [AKS87] Ajtai, M., Komlós, J., Szemerédi, E.: Deterministic simulation in logspace. In: STOC, pp. 132-140 (1987)
3. [AMN98] Azar, Y., Motwani, R., Naor, J.: Approximating probability distributions using small sample spaces. Combinatorica 18(2), 151-171 (1998)
4. [Bar86] Barrington, D.A.M.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. In: STOC, pp. 1-5 (1986)
5. [BDVY08] Bogdanov, A., Dvir, Z., Verbin, E., Yehudayoff, A.: Pseudorandomness for width 2 branching programs (manuscript, 2008)
6. +94] Blum, M., Evans, W.S., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories. Algorithmica 12(2/3), 225-244 (1994)
7. [BV07] Bogdanov, A., Viola, E.: Pseudorandom bits for polynomials. In: FOCS, pp. 41-51 (2007)
8. [Her75] Herstein, I.: Topics in algebra. Wiley, Chichester (1975)
9. [INW94] Impagliazzo, R., Nisan, N., Wigderson, A.: Pseudorandomness for network algorithms. In: STOC, pp. 356-364 (1994)
10. [Lov08] Lovett, S.: Unconditional pseudorandom generators for low degree polynomials. In: STOC, pp. 557-562 (2008)
11. [LRTV09] Lovett, S., Reingold, O., Trevisan, L., Vadhan, S.: Pseudorandom bit generators that fool modular sums. In: RANDOM (2009)
12. [LY94] Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41(5), 960-981 (1994)
13. [Nis92] Nisan, N.: Pseudorandom generators for space-bounded computation. Combinatorica 12(4), 449-461 (1992)
14. [NN93] Naor, J., Naor, M.: Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput. 22(4), 838-856 (1993)
15. [NZ96] Nisan, N., Zuckerman, D.: Randomness is linear in space. J. Comput. Syst. Sci. 52(1), 43-52 (1996)
16. [Rei08] Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4) (2008)
17. [RR99] Raz, R., Reingold, O.: On recycling the randomness of states in space bounded computation. In: STOC, pp. 159-168 (1999)
18. [RV06] Reingold, O., Vadhan, S.: Personal communication (2006)
19. [SZ] Saks, M., Zuckerman, D. (unpublished manuscript)
20. [Vio08] Viola, E.: The sum of d small-bias generators fools polynomials of degree d. In: IEEE Conference on Computational Complexity, pp. 124-127 (2008)