Pseudorandom bits for constant depth circuits
- 1 March 1991
- journal article
- research article
- Published by Springer Nature in Combinatorica
- Vol. 11 (1) , 63-70
- https://doi.org/10.1007/bf01375474
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Pseudorandom number generation and space complexityInformation and Control, 1985
- Deterministic simulation of probabilistic constant depth circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A theorem on probabilistic constant depth ComputationsPublished by Association for Computing Machinery (ACM) ,1984
- ∑11-Formulae on finite structuresAnnals of Pure and Applied Logic, 1983
- How to generate cryptographically strong sequences of pseudo random bitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Parity, circuits, and the polynomial-time hierarchyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981
- AlternationJournal of the ACM, 1981
- Two theorems on random polynomial timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978