The Resource Primality testing in polynomial time : from randomized algorithms to "primes" is in P, Martin Dietzfelbinger
Primality testing in polynomial time : from randomized algorithms to "primes" is in P, Martin Dietzfelbinger
Resource Information
The item Primality testing in polynomial time : from randomized algorithms to "primes" is in P, Martin Dietzfelbinger represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Primality testing in polynomial time : from randomized algorithms to "primes" is in P, Martin Dietzfelbinger represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
- Summary
- 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
- Language
- eng
- Edition
- 1st ed.
- Extent
- 1 online resource (x, 147 pages).
- Contents
-
- 1. Introduction: Efficient Primality Testing
- 2. Algorithms for Numbers and Their Complexity
- 3. Fundamentals from Number Theory
- 4. Basics from Algebra: Groups, Rings, and Fields
- 5. The Miller-Rabin Test
- 6. The Solovay-Strassen Test
- 7. More Algebra: Polynomials and Fields
- 8. Deterministic Primality Testing in Polynomial Time
- A. Appendix
- Isbn
- 9783540259336
- Label
- Primality testing in polynomial time : from randomized algorithms to "primes" is in P
- Title
- Primality testing in polynomial time
- Title remainder
- from randomized algorithms to "primes" is in P
- Statement of responsibility
- Martin Dietzfelbinger
- Language
- eng
- Summary
- 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
- Cataloging source
- COO
- http://library.link/vocab/creatorName
- Dietzfelbinger, Martin
- Dewey number
- 512.9/42
- Index
- index present
- Language note
- English
- LC call number
- QA246
- LC item number
- .D54 2004
- Literary form
- non fiction
- Nature of contents
-
- dictionaries
- bibliography
- Series statement
-
- LNCS,
- Tutorial
- Series volume
- 3000.
- http://library.link/vocab/subjectName
-
- Polynomials
- Numbers, Prime
- Algorithms
- MATHEMATICS
- Algorithms
- Numbers, Prime
- Polynomials
- Label
- Primality testing in polynomial time : from randomized algorithms to "primes" is in P, Martin Dietzfelbinger
- Bibliography note
- Includes bibliographical references (pages 143-144) and index
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- 1. Introduction: Efficient Primality Testing -- 2. Algorithms for Numbers and Their Complexity -- 3. Fundamentals from Number Theory -- 4. Basics from Algebra: Groups, Rings, and Fields -- 5. The Miller-Rabin Test -- 6. The Solovay-Strassen Test -- 7. More Algebra: Polynomials and Fields -- 8. Deterministic Primality Testing in Polynomial Time -- A. Appendix
- Control code
- 61104229
- Dimensions
- unknown
- Edition
- 1st ed.
- Extent
- 1 online resource (x, 147 pages).
- Form of item
- online
- Isbn
- 9783540259336
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/b12334
- Specific material designation
- remote
- System control number
- (OCoLC)61104229
- Label
- Primality testing in polynomial time : from randomized algorithms to "primes" is in P, Martin Dietzfelbinger
- Bibliography note
- Includes bibliographical references (pages 143-144) and index
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- 1. Introduction: Efficient Primality Testing -- 2. Algorithms for Numbers and Their Complexity -- 3. Fundamentals from Number Theory -- 4. Basics from Algebra: Groups, Rings, and Fields -- 5. The Miller-Rabin Test -- 6. The Solovay-Strassen Test -- 7. More Algebra: Polynomials and Fields -- 8. Deterministic Primality Testing in Polynomial Time -- A. Appendix
- Control code
- 61104229
- Dimensions
- unknown
- Edition
- 1st ed.
- Extent
- 1 online resource (x, 147 pages).
- Form of item
- online
- Isbn
- 9783540259336
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/b12334
- Specific material designation
- remote
- System control number
- (OCoLC)61104229
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Primality-testing-in-polynomial-time--from/6gwiMjQ1o1g/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Primality-testing-in-polynomial-time--from/6gwiMjQ1o1g/">Primality testing in polynomial time : from randomized algorithms to "primes" is in P, Martin Dietzfelbinger</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Primality testing in polynomial time : from randomized algorithms to "primes" is in P, Martin Dietzfelbinger
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Primality-testing-in-polynomial-time--from/6gwiMjQ1o1g/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Primality-testing-in-polynomial-time--from/6gwiMjQ1o1g/">Primality testing in polynomial time : from randomized algorithms to "primes" is in P, Martin Dietzfelbinger</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
