Primality Testing in Polynomial Time
Subtitle: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science)
Edition: 1 edition
Publisher: Springer
Published: August 17, 2004
Language: eng
Format: Paperback
Number of pages: 147
ISBN-13: 9783540403449
Subjects: Number Theory; Numbers, Prime; Computers - General Information; Technology; Computers - Computer Security; Science/Mathematics; Security - General; Polynomials; Computer Science; Computational Number Thoery; Computers / Computer Science; Deterministic Primality Testing; Efficient Algorithms; Efficient Primality Testing; Factorization; Number Theoretical Algorithms; Polynomia Time Algorithms; Primality Testing; Randomized Algorithms; Engineering - Electrical & Electronic; Algorithms
First sentence: A natural number n > 1 is called a prime number if it has no positive divisors other than 1 and n.