Randomised algorithms

This publication has 18 references indexed in Scilit:

• 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
• Probabilistic two-way machines
  Lecture Notes in Computer Science, 1981
• Absolute primality of polynomials is decidable in random polynomial time in the number of variables
  Published by Springer Nature ,1981
• Random Graph Isomorphism
  SIAM Journal on Computing, 1980
• Fast probabilistic algorithms for hamiltonian circuits and matchings
  Journal of Computer and System Sciences, 1979
• Fast probabilistic algorithms
  Lecture Notes in Computer Science, 1979
• Covering a graph by circuits
  Published by Springer Nature ,1978
• Computational Complexity of Probabilistic Turing Machines
  SIAM Journal on Computing, 1977
• Factoring polynomials over large finite fields
  Mathematics of Computation, 1970
• Paths, Trees, and Flowers
  Canadian Journal of Mathematics, 1965