• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Boolean Grobner Bases -- Theory, Algorithms and Applications

Boolean Grobner Bases -- Theory, Algorithms and Applications

Paperback

General ComputersGeneral Mathematics

Currently unavailable to order

ISBN10: 3832525971
ISBN13: 9783832525972
Publisher: Logos Verlag Berlin
Published: Sep 10 2010
Pages: 160
Weight: 1.00
Height: 0.40 Width: 5.68 Depth: 8.04
Language: English
There exist very few concepts in computational algebra which are as central to theory and applications as Grobner bases. This thesis describes theory, algorithms and applications for the special case of Boolean polynomials. These parts form the mathematical foundations of the PolyBoRi framework (developed by the author together with Alexander Dreyer). The PolyBoRi framework has applications spread over a large number of domains ranging from formal verification, computational biology to cryptanalysis and many more. It is emerged to a worldwide audience by the Sage computational algebra system.

Also in

General Computers