{
"item_title" : "Boolean Grobner Bases -- Theory, Algorithms and Applications",
"item_author" : [" Michael Brickenstein "],
"item_description" : "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.",
"item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/83/252/597/3832525971_b.jpg",
"price_data" : {
"retail_price" : "53.00", "online_price" : "53.00", "our_price" : "53.00", "club_price" : "53.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Boolean Grobner Bases -- Theory, Algorithms and Applications
Overview
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.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9783832525972
- ISBN-10: 3832525971
- Publisher: Logos Verlag Berlin
- Publish Date: September 2010
- Dimensions: 8.04 x 5.68 x 0.4 inches
- Shipping Weight: 1 pounds
- Page Count: 160
Related Categories
