| 000 -LEADER |
|---|
| fixed length control field |
00527nam a2200169Ia 4500 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
161214s9999 xx 000 0 und d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9783540403449 |
| Terms of availability |
pbk |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
004 |
| Item number |
DIE |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Dietzfelbinger, M. |
| 245 #0 - TITLE STATEMENT |
|---|
| Title |
Primality Testing in Polynomial Time : From Randomized Algorithms to Primes is in p |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
Berlin: |
| Name of publisher, distributor, etc |
Springer-Verlag, |
| Date of publication, distribution, etc |
2004 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
x, 147 p.; |
| Other physical details |
: |
| Dimensions |
24 cm. |
| 365 ## - TRADE PRICE |
|---|
| Price type code |
INR |
| Price amount |
1494.51 |
| 490 ## - SERIES STATEMENT |
|---|
| Series statement |
Lecture notes in computer science |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
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 n, are important for theoretical computer science and for applications in algorithmics and cryptology. This book gives a self-contained account of theoretically and practically important efficient algorithms for the primality problem, covering 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 textbook is written for students of computer science, in particular for 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. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Algorithms |
|
|---|
| Topical term or geographic name as entry element |
Polynominal testing |
|
|---|
| Topical term or geographic name as entry element |
Numbers, Prime. |
|
|---|
| Topical term or geographic name as entry element |
Electronic books. |
|
|---|
| Topical term or geographic name as entry element |
Miller-Rabin |
|
|---|
| Topical term or geographic name as entry element |
Solovay-Strassen |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
Books |