Probabilistic Number-theoretic Algorithms
Probabilistic Number-Theoretic Algorithms is a class of algorithms in computational number theory that employs probabilistic methods, such as random sampling or stochastic processes, to solve number-theoretic problems with a high likelihood of correctness, distinguishing it from deterministic number-theoretic algorithms by its inherent reliance on randomness and bounded error probability.
24
Publications
1.8K
Citations
39
Authors
26
Institutions
Publications per year
2017–2026
0
Parents
24
Probabilistic Algorithms in Finite Fields
Michael O. Rabin · SIAM Journal on Computing · 1980 · 319 citations
Probabilistic algorithms in finite fields
Michael Ben-Or · 1981 · 161 citations
Philippe Flajolet, G. Nigel Martin · 1983 · 156 citations
Asymptotically fast factorization of integers
Mathematics of Computation · 1981 · 130 citations
1–5 of 24
39
3
h-index
1 publications · 23 citations
1
h-index
1
h-index
National Institute of Standards and Technology, United States
1 publications · 63 citations
1
h-index
1
h-index
1–5 of 39
26
University of California, Berkeley
Berkeley, United States
2 h-index
3 publications
107 citations
University of California San Diego
San Diego, United States
1 h-index
1 publications
18 citations
Eastern Regional Research Center
Wyndmoor, United States
1 h-index
3 publications
36 citations

University of Tübingen
Tübingen, Germany
1 h-index
1 publications
16 citations

Eötvös Loránd University
Budapest, Hungary
1 h-index
1 publications
21 citations
IBM (United Kingdom)
Winchester, United Kingdom
1 h-index
1 publications
156 citations
California Southern University
Chandler, United States
1 h-index
1 publications
39 citations
Saint Joseph's University
Philadelphia, United States
1 h-index
1 publications
18 citations
1–8 of 26
MCOM · 4 publications · 259 citations
4
h-index
2 publications · 34 citations
2
h-index
1 publications · 71 citations
1
h-index
Repository · 1 publications · 39 citations
1
h-index
1 publications · 35 citations
1
h-index
1–5