On the power of probabilistic choice in synchronous parallel computations
- 1 January 1982
- book chapter
- Published by Springer Nature
- p. 442-450
- https://doi.org/10.1007/bfb0012790
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Irreducibility testing and factorization of polynomialsPublished 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
- Hardware complexity and parallel computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- On distinguishing prime numbers from composite numbersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Random walks, universal traversal sequences, and the complexity of maze problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Two theorems on random polynomial timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- On taking roots in finite fieldsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952