First developed in the early 1980s by Lenstra, Lenstra, and Lovasz, the LLL algorithm was originally used to provide a polynomial-time algorithm for factoring polynomials with rational coefficients. It very quickly became an essential tool in integer linear programming problems and was later adapted for use in cryptanalysis. This book provides an i
Bu e-kitabı satın alın ve 1 tane daha ÜCRETSİZ kazanın!
Dil İngilizce ● Biçim PDF ● Sayfalar 332 ● ISBN 9781439807040 ● Yayımcı CRC Press ● Yayınlanan 2011 ● İndirilebilir 6 kez ● Döviz EUR ● Kimlik 2381892 ● Kopya koruma Adobe DRM
DRM özellikli bir e-kitap okuyucu gerektirir