Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications

Author:   Murray R. Bremner
Publisher:   Taylor & Francis Inc
ISBN:  

9781439807026


Pages:   332
Publication Date:   12 August 2011
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $231.00 Quantity:  
Add to Cart

Share |

Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications


Add your own review!

Overview

Full Product Details

Author:   Murray R. Bremner
Publisher:   Taylor & Francis Inc
Imprint:   CRC Press Inc
Dimensions:   Width: 15.60cm , Height: 1.50cm , Length: 23.40cm
Weight:   0.612kg
ISBN:  

9781439807026


ISBN 10:   1439807027
Pages:   332
Publication Date:   12 August 2011
Audience:   Professional and scholarly ,  General/trade ,  Professional & Vocational ,  General
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Introduction to Lattices. Two-Dimensional Lattices. Gram-Schmidt Orthogonalization. The LLL Algorithm. Deep Insertions. Linearly Dependent Vectors. The Knapsack Problem. Coppersmith’s Algorithm. Diophantine Approximation. The Fincke-Pohst Algorithm. Kannan’s Algorithm. Schnorr’s Algorithm. NP-Completeness. The Hermite Normal Form. Polynomial Factorization.

Reviews

the book succeeds in making accessible to nonspecialists the area of lattice algorithms, which is remarkable because some of the most important results in the field are fairly recent. --M. Zimand, Computing Reviews, March 2012


the book succeeds in making accessible to nonspecialists the area of lattice algorithms, which is remarkable because some of the most important results in the field are fairly recent. -M. Zimand, Computing Reviews, March 2012


Author Information

Murray R. Bremner received a Bachelor of Science from the University of Saskatchewan in 1981, a Master of Computer Science from Concordia University in Montreal in 1984, and a Doctorate in Mathematics from Yale University in 1989. He spent one year as a Postdoctoral Fellow at the Mathematical Sciences Research Institute in Berkeley, and three years as an Assistant Professor in the Department of Mathematics at the University of Toronto. He returned to the Department of Mathematics and Statistics at the University of Saskatchewan in 1993 and was promoted to Professor in 2002. His research interests focus on the application of computational methods to problems in the theory of linear nonassociative algebras, and he has had more than 50 papers published or accepted by refereed journals in this area.

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

lgn

al

Shopping Cart
Your cart is empty
Shopping cart
Mailing List