Murray R. Bremner – författare
Visar alla böcker från författaren Murray R. Bremner. Handla med fri frakt och snabb leverans.
9 produkter
Algebraic Operads
An Algorithmic Companion
Av Murray R. Bremner, Vladimir Dotsenko
Häftad, 2024
1203 kr
Lägg i varukorg
Algebraic Operads: An Algorithmic Companion 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. The …
Lattice Basis Reduction
An Introduction to the LLL Algorithm and Its Applications
Häftad, 2024
926 kr
Lägg i varukorg
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 …
Algebraic Operads
An Algorithmic Companion
Av Vladimir Dotsenko, Murray R. Bremner
E-bok, 2016
1389 kr
Lägg i varukorg
This book 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. Throughout the book, both the …
Lattice Basis Reduction
An Introduction to the LLL Algorithm and Its Applications
E-bok, 2011
970 kr
Lägg i varukorg
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 …
Lattice Basis Reduction
An Introduction to the LLL Algorithm and Its Applications
Inbunden, 2011
2141 kr
Lägg i varukorg
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 …
Lattice Basis Reduction
An Introduction to the LLL Algorithm and Its Applications
E-bok, 2011
970 kr
Lägg i varukorg
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 …
Nonassociative Mathematics and Its Applications
Av Petr Vojtechovsky, Murray R. Bremner m. fl.
Häftad, 2019
1703 kr
Lägg i varukorg
Nonassociative mathematics is a broad research area that studies mathematical structures violating the associative law $x(yz)=(xy)z$. The topics covered by nonassociative mathematics include quasigroups, loops, Latin squares, Lie algebras, Jordan algebras, octonions, racks, quandles, and their …
Algebraic Operads
An Algorithmic Companion
Av Murray R. Bremner, Vladimir Dotsenko
Inbunden, 2016
2141 kr
Lägg i varukorg
Algebraic Operads: An Algorithmic Companion 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. The …
Algebraic Operads
An Algorithmic Companion
Av Vladimir Dotsenko, Murray R. Bremner
E-bok, 2016
1420 kr
Lägg i varukorg
This book 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. Throughout the book, both the …
