Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields

No abstract is available for this paper.

• Publication year

  2010

• Venue

  IEEE Annual Symposium on Foundations of Computer Science

• Publication date

  2010-10-23

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s00037-012-0051-7
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Non-uniform ACC Circuit Lower Bounds

  2011cited by this paper
• Poly-logarithmic Independence Fools AC^0 Circuits

  2009cited by this paper
• Small-Bias Spaces for Group Products

  2009influential reference
• Computational Complexity: A Modern Approach

  2009cited by this paper
• Pseudorandom Bit Generators That Fool Modular Sums

  2009influential reference
• Licensed under a Creative Commons Attribution License

  2008cited by this paper
• The Sum of D Small-Bias Generators Fools Polynomials of Degree D

  2008cited by this paper
• Game Theoretic Approach to Air Combat Simulation Analysis

  2008cited by this paper
• Computational complexity - a conceptual perspective

  2008cited by this paper
• Parameterized Proof Complexity

  2007cited by this paper
• Pseudorandom Bits for Polynomials

  2007influential reference
• Polylogarithmic Independence Can Fool DNF Formulas

  2007influential reference
• Deterministic approximate counting of depth-2 circuits

  1993influential reference
• Simple Construction of Almost k-wise Independent Random Variables

  1992cited by this paper
• Pseudorandom bits for constant depth circuits

  1991cited by this paper
• Small-bias probability spaces: efficient constructions and applications

  1990cited by this paper
• Approximate Inclusion-Exclusion

  1990cited by this paper
• Hardness vs. randomness

  1988cited by this paper
• Lower bounds on the size of bounded depth circuits over a complete basis with logical addition

  1987influential reference
• Computational limitations of small-depth circuits

  1987cited by this paper
• Algebraic methods in the theory of lower bounds for Boolean circuit complexity

  1987influential reference
• ∑11-Formulae on finite structures

  1983cited by this paper

• XOR lemmas for resilient functions against polynomials

  2020influential citation
• A Random Key Generation Scheme Using Primitive Polynomials over GF(2)

  2016cites this paper
• Uniformity and correlation test parameters for random numbers generators

  2014cites this paper
• The Computational Complexity of Randomness

  2013cites this paper
• Additive Combinatorics: With a View Towards Computer Science and Cryptography - An Exposition

  2013cites this paper
• Pseudorandom generators for combinatorial checkerboards

  2011cites this paper
• Additive combinatorics with a view towards computer science and cryptography: An exposition

  2011cites this paper