Faster access than browser!
14 relations: Algorithm, Annals of Mathematics, Carl Pomerance, Computational number theory, Cyclotomic field, Deterministic algorithm, Hendrik Lenstra, Henri Cohen (number theorist), Leonard Adleman, Mathematics of Computation, Primality test, Prime number, Robert Rumely, UBASIC.
Algorithm
In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems.
New!!: Adleman–Pomerance–Rumely primality test and Algorithm · See more »
Annals of Mathematics
The Annals of Mathematics is a bimonthly mathematical journal published by Princeton University and the Institute for Advanced Study.
New!!: Adleman–Pomerance–Rumely primality test and Annals of Mathematics · See more »
Carl Pomerance
Carl Bernard Pomerance (born 1944 in Joplin, Missouri) is an American number theorist.
New!!: Adleman–Pomerance–Rumely primality test and Carl Pomerance · See more »
Computational number theory
In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of algorithms for performing number theoretic computations.
New!!: Adleman–Pomerance–Rumely primality test and Computational number theory · See more »
Cyclotomic field
In number theory, a cyclotomic field is a number field obtained by adjoining a complex primitive root of unity to, the field of rational numbers.
New!!: Adleman–Pomerance–Rumely primality test and Cyclotomic field · See more »
Deterministic algorithm
In computer science, a deterministic algorithm is an algorithm which, given a particular input, will always produce the same output, with the underlying machine always passing through the same sequence of states.
New!!: Adleman–Pomerance–Rumely primality test and Deterministic algorithm · See more »
Hendrik Lenstra
Hendrik Willem Lenstra Jr. (born 16 April 1949, Zaandam) is a Dutch mathematician.
New!!: Adleman–Pomerance–Rumely primality test and Hendrik Lenstra · See more »
Henri Cohen (number theorist)
Henri Cohen (born 8 June 1947) is a number theorist, and a Professor at the University of Bordeaux.
New!!: Adleman–Pomerance–Rumely primality test and Henri Cohen (number theorist) · See more »
Leonard Adleman
Leonard Adleman (born December 31, 1945) is an American computer scientist.
New!!: Adleman–Pomerance–Rumely primality test and Leonard Adleman · See more »
Mathematics of Computation
Mathematics of Computation is a bimonthly mathematics journal focused on computational mathematics.
New!!: Adleman–Pomerance–Rumely primality test and Mathematics of Computation · See more »
Primality test
A primality test is an algorithm for determining whether an input number is prime.
New!!: Adleman–Pomerance–Rumely primality test and Primality test · See more »
Prime number
A prime number (or a prime) is a natural number greater than 1 that cannot be formed by multiplying two smaller natural numbers.
New!!: Adleman–Pomerance–Rumely primality test and Prime number · See more »
Robert Rumely
Robert Scott Rumely (born 1952) is a professor of mathematics at the University of Georgia who specializes in number theory and arithmetic geometry.
New!!: Adleman–Pomerance–Rumely primality test and Robert Rumely · See more »
UBASIC
UBASIC is a freeware (public domain software without source code) BASIC interpreter written by Yuji Kida at Rikkyo University in Japan, specialized for mathematical computing.
New!!: Adleman–Pomerance–Rumely primality test and UBASIC · See more »
Redirects here:
APR primality test, APR test, APR-CL, APRT-CL, Adleman-Pomerance-Rumely primality test, Adleman-Rumely primality test.
References
[1] https://en.wikipedia.org/wiki/Adleman–Pomerance–Rumely_primality_test
