A self-contained treatment of theoretically and practically
important efficient algorithms for the primality problem. The text
covers the randomized algorithms by Solovay-Strassen and
Miller-Rabin from the late 1970s as well as the recent
deterministic algorithm of Agrawal, Kayal and Saxena. The volume is
written for students of computer science, in particular those with
a special interest in cryptology, and students of mathematics, and
it may be used as a supplement for courses or for self-study.
General
| Imprint: |
Springer-Verlag
|
| Country of origin: |
Germany |
| Series: |
Lecture Notes in Computer Science, 3000 |
| Release date: |
June 2004 |
| First published: |
June 2004 |
| Authors: |
Martin Dietzfelbinger
|
| Dimensions: |
233 x 155 x 8mm (L x W x T) |
| Format: |
Paperback
|
| Pages: |
150 |
| Edition: |
2004 ed. |
| ISBN-13: |
978-3-540-40344-9 |
| Categories: |
Books >
Science & Mathematics >
Mathematics >
Algebra >
General
|
| LSN: |
3-540-40344-2 |
| Barcode: |
9783540403449 |
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
