On Synchronous Parallel Computations with Independent Probabilistic Choice

This publication has 20 references indexed in Scilit:

• Fast parallel matrix and GCD computations
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
  SIAM Journal on Computing, 1981
• Random walks, universal traversal sequences, and the complexity of maze problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1979
• Fast probabilistic algorithms
  Lecture Notes in Computer Science, 1979
• Two theorems on random polynomial time
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1978
• Parallelism in random access machines
  Published by Association for Computing Machinery (ACM) ,1978
• Computational Complexity of Probabilistic Turing Machines
  SIAM Journal on Computing, 1977
• Fast Parallel Matrix Inversion Algorithms
  SIAM Journal on Computing, 1976
• Factoring polynomials over large finite fields
  Mathematics of Computation, 1970
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
  The Annals of Mathematical Statistics, 1952