Skip to main content
PBS logo
 
 

Search - Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science)

Primality Testing in Polynomial Time: From Randomized Algorithms to
Primality Testing in Polynomial Time From Randomized Algorithms to PRIMES Is in P - Lecture Notes in Computer Science
Author: Martin Dietzfelbinger
This book is devoted to algorithms for the venerable primality problem: Given a natural number n, decide whether it is prime or composite. The problem is basic in number theory, efficient algorithms that solve it, i.e., algorithms that run in a number of computational steps which is polynomial in the number of digits needed to write ...  more »
ISBN-13: 9783540403449
ISBN-10: 3540403442
Publication Date: 8/17/2004
Pages: 147
Edition: 1
Rating:
  ?
0 stars, based on 0 rating
Publisher: Springer
Book Type: Paperback
Members Wishing: 0
Reviews: Amazon | Write a Review


Genres:


Back to the Top ↑
By using this Web site, you confirm that you have read, understood, and agreed to be bound by the Terms of Use. As an Amazon Associate we earn from qualifying purchases.
US Patent Number 7,877,315 | Copyright © 2004 - 2024 PaperBackSwap.com. All Rights Reserved.