Randomised algorithms
Author:
- 1 January 1983
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 5 (1) , 133-145
Abstract
No abstract availableKeywords
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 1SIAM Journal on Computing, 1981
- Probabilistic two-way machinesLecture Notes in Computer Science, 1981
- Absolute primality of polynomials is decidable in random polynomial time in the number of variables1981
- Random Graph IsomorphismSIAM Journal on Computing, 1980
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- Fast probabilistic algorithms1979
- Covering a graph by circuits1978
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965