Wyniki wyszukiwania:

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 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,...

Algebraic Operads: An Algorithmic Companion presents a systematic treatment of Grobner bases in several contexts. The book builds up to the theory of Grobner bases for operads due to the second author and Khoroshkin as well as various applications of the corresponding diamond lemmas in algebra.

The authors present a variety of topics including: noncommutative Grobner bases and their applications to the construction of universal enveloping algebras; Grobner bases for shuffle algebras which can be used to solve questions about combinatorics of permutations; and...