Primality testing in polynomial time : from randomized algorithms to "PRIMES is in P"
On August 6, 2002,a paper with the title PRIMES is in P , by M. Agrawal, N. Kayal, and N. Saxena, appeared on the website of the Indian Institute of Technology at Kanpur, India. In this paper it was shown that the primality problem hasa deterministic algorithm that runs in polynomial time . Finding...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
3000 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Primality testing in polynomial time, from randomized algorithms to "PRIMES is in P", Martin Dietzfelbinger, 2004, Berlin, Springer, 1 vol. (X-147 p.), Lecture notes in computer science, 3-540-40344-2 • Primality Testing in Polynomial Time, Texte imprimé, 9783662174456 |
Obsah:
- 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.