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
Köp den här e-boken och få 1 till GRATIS!
Språk Engelska ● Formatera PDF ● Sidor 332 ● ISBN 9781439807040 ● Utgivare CRC Press ● Publicerad 2011 ● Nedladdningsbara 6 gånger ● Valuta EUR ● ID 2381892 ● Kopieringsskydd Adobe DRM
Kräver en DRM-kapabel e-läsare