Randomized polynomials, threshold circuits, and the polynomial hierarchy

This publication has 13 references indexed in Scilit:

• On threshold circuits for parity
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• PP is closed under intersection
  Published by Association for Computing Machinery (ACM) ,1991
• Small-bias probability spaces: efficient constructions and applications
  Published by Association for Computing Machinery (ACM) ,1990
• A note on the power of threshold circuits
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• Constant depth circuits, Fourier transform, and learnability
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
  Mathematical Notes, 1987
• Algebraic methods in the theory of lower bounds for Boolean circuit complexity
  Published by Association for Computing Machinery (ACM) ,1987
• The complexity of combinatorial problems with succinct input representation
  Acta Informatica, 1986
• Computational Complexity of Probabilistic Turing Machines
  SIAM Journal on Computing, 1977
• Rational approximation to $| x| $.
  The Michigan Mathematical Journal, 1964