MENÜ
Boolean Gröbner bases - Theory, Algorithms and Applications
Michael Brickenstein
ISBN 978-3-8325-2597-2
160 pages, year of publication: 2010
price: 35.00 €
Boolean Gröbner bases - Theory, Algorithms and Applications
There exist very few concepts in computational algebra which are as central to theory and applications as Gröbner 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.
- Boolean Gröbner bases
- Satisfiability
- Cryptanalysis
- Formal Verification
- Computational Biology
BUYING OPTIONS
| 35.00 € | ||
| only 3 in stock | ||
| 34.00 € | ||
| 45.00 € | ||
| 49.00 € | ||
(W) = Abroad
You can purchase the eBook (PDF) alone or combined with the printed book (Bundle). In both cases we use the payment service of PayPal for charging you - nevertheless it is not necessary to have a PayPal-account. With purchasing the eBook or eBundle you accept our licence for eBooks.
For multi-user or campus licences (MyLibrary) please fill in the form or write an email to order@logos-verlag.de