Primality Testing in Polynomial Time
From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science)
1 edition
Our rough guess is there are 36,750 words in this book.
At a pace averaging 250 words per minute, this book will take 2 hours and 27 minutes to read. With a half hour per day, this will take 5 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Word Count
36,750 words, Guess
Page Count
147 pages
Physical Format
Paperback
Identifiers
- Open LibraryOL9056931M
- ISBN-139783540403449
- ISBN-103540403442
- OCLC Control Number55967808
- OCLC Control Numberprimalitytesting00diet_243
and 3 more
- Library of Congress Control Number2004107785
- Goodreads4339174
- LibraryThing7818140
Classifications
- LCCQA246 .D54 2004
First Sentence
A natural number n > 1 is called a prime number if it has no positive divisors other than 1 and n.
Subjects
Topics
Other Editions
- Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science)
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!