Pastāsti draugiem par šo preci:
Complexity of Lattice Problems: A Cryptographic Perspective - The Springer International Series in Engineering and Computer Science Daniele Micciancio Softcover reprint of the original 1st ed. 2002 edition
Complexity of Lattice Problems: A Cryptographic Perspective - The Springer International Series in Engineering and Computer Science
Daniele Micciancio
The study of lattices, specifically from a computational point of view, was marked by two major breakthroughs: the development of the LLL lattice reduction algorithm by Lenstra, Lenstra and Lovasz in the early 80's, and Ajtai's discovery of a connection between the worst-case and average-case hardness of certain lattice problems in the late 90's.
220 pages, biography
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2012. gada 29. oktobris |
| ISBN13 | 9781461352938 |
| Izdevēji | Springer-Verlag New York Inc. |
| Lapas | 220 |
| Izmēri | 155 × 235 × 12 mm · 367 g |
| Valoda | Angļu |
Vairāk no Daniele Micciancio
Rādīt visuVairāk no tā paša izdevēja
Skatīt visus Daniele Micciancio ( piem., Paperback Book )