
Fortæl dine venner om denne vare:
Primality Testing and Integer Factorization in Public-Key Cryptography - Advances in Information Security Softcover reprint of hardcover 2nd ed. 2009 edition
Song Y. Yan
Pris
NOK 1.989
Bestilles fra fjernlager
Forventes klar til forsendelse 31. okt. - 6. nov.
Tilføj til din iMusic ønskeseddel
eller
Findes også som:
Primality Testing and Integer Factorization in Public-Key Cryptography - Advances in Information Security Softcover reprint of hardcover 2nd ed. 2009 edition
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
Medie | Bøger Paperback Bog (Bog med blødt omslag og limet ryg) |
Udgivet | 29. november 2010 |
ISBN13 | 9781441945860 |
Forlag | Springer-Verlag New York Inc. |
Antal sider | 371 |
Mål | 155 × 235 × 20 mm · 548 g |
Sprog | Engelsk |