Pastāsti draugiem par šo preci:
Primality Testing and Integer Factorization in Public-Key Cryptography - Advances in Information Security Song Y. Yan Softcover reprint of hardcover 2nd ed. 2009 edition
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
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2010. gada 29. novembris |
| ISBN13 | 9781441945860 |
| Izdevēji | Springer-Verlag New York Inc. |
| Lapas | 371 |
| Izmēri | 155 × 235 × 20 mm · 548 g |
| Valoda | Angļu |
Vairāk no Song Y. Yan
Rādīt visuMere med samme udgiver
Skatīt visus Song Y. Yan ( piem., Hardcover Book un Paperback Book )