Join thousands of book lovers
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.You can, at any time, unsubscribe from our newsletters.
This book presents a systematic treatment of Gröbner bases in several contexts. The book builds up to the theory of Gröbner bases for operads due to the second author and Khoroshkin as well as various applications of the corresponding diamond lemmas in algebra. Throughout the book, both the mathematical theory and computational methods are emphasized and numerous algorithms, examples, and exercises are provided to clarify and illustrate the concrete meaning of abstract theory.
First developed in the early 1980s by Lenstra, Lenstra, and Lov sz, 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 introduction to the theory and applications of lattice basis reduction and the LLL algorithm. With numerous examples and suggested exercises, the text discusses various applications of lattice basis reduction to cryptography, number theory, polynomial factorization, and matrix canonical forms.
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.