Realistic analysis of some randomized algorithms
- 28 February 1991
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 42 (1) , 30-53
- https://doi.org/10.1016/0022-0000(91)90038-7
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the power of two-point based samplingJournal of Complexity, 1989
- Factoring Integers with Elliptic CurvesAnnals of Mathematics, 1987
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- Multidimensional numerical integration using pseudorandom numbersPublished by Springer Nature ,1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de nActa Arithmetica, 1982
- Evaluation and comparison of two efficient probabilistic primality testing algorithmsTheoretical Computer Science, 1980
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- Riemann's hypothesis and tests for primalityJournal of Computer and System Sciences, 1976