Fortell venner om denne varen:
Primality Testing and Integer Factorization in Public-Key Cryptography - Advances in Information Security Song Y. Yan Softcover reprint of hardcover 2nd ed. 2009 edition
Pris
NOK 1.619
Bestillingsvarer
Forventes levert 5. - 9. jan 2026
Julegaver kan byttes frem til 31. januar
Legg til iMusic ønskeliste
eller
Finnes også som:
Primality Testing and Integer Factorization in Public-Key Cryptography - Advances in Information Security
Song Y. Yan
The Primality Testing Problem (PTP) has now proved to be solvable in deterministic polynomial-time (P) by the AKS (Agrawal-Kayal-Saxena) algorithm, whereas the Integer Factorization Problem (IFP) still remains unsolvable in (P).
389 pages, 40 black & white illustrations, 10 black & white tables, biography
| Media | Bøker Pocketbok (Bok med mykt omslag og limt rygg) |
| Utgitt | 29. november 2010 |
| ISBN13 | 9781441945860 |
| Utgivere | Springer-Verlag New York Inc. |
| Antall sider | 371 |
| Mål | 155 × 235 × 20 mm · 548 g |
| Språk | Engelsk |