Realistic analysis of some randomized algorithms
From MaRDI portal
Publication:2277019
DOI10.1016/0022-0000(91)90038-7zbMath0724.11069OpenAlexW1985217658MaRDI QIDQ2277019
Publication date: 1991
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(91)90038-7
complexityalgorithmsbibliographyalgebraic curvesrandom numbersCipolla-Lehmer algorithmMiller primality testsTonelli-Shanks method
Related Items (7)
On the computation of rational points of a hypersurface over a finite field ⋮ Weil bounds for singular curves ⋮ Quasi-random rumor spreading: reducing randomness can be costly ⋮ On pseudorandomness in families of sequences derived from the Legendre symbol ⋮ 1998 Spring Meeting of the Association for Symbolic Logic ⋮ A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading ⋮ Primality testing with fewer random bits
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring integers with elliptic curves
- On using deterministic functions to reduce randomness in probabilistic algorithms
- Expanders, randomness, or time versus space
- On the power of two-point based sampling
- Probabilistic algorithm for testing primality
- Evaluation and comparison of two efficient probabilistic primality testing algorithms
- Equations over finite fields. An elementary approach
- Riemann's hypothesis and tests for primality
- Provably good pattern generators for a random pattern test
- Some properties of the cyclotomic polynomial
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- A Simple Unpredictable Pseudo-Random Number Generator
- Multidimensional numerical integration using pseudorandom numbers
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- 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 n
This page was built for publication: Realistic analysis of some randomized algorithms
