Name | Modified | Size | Downloads / Week |
---|---|---|---|
Parent folder | |||
readme.txt | 2011-02-25 | 1.6 kB | |
polybori-0.7.tar.gz | 2011-02-25 | 2.4 MB | |
Totals: 2 Items | 2.4 MB | 0 |
PolyBoRi: The core of PolyBoRi is a C++ library, which provides high-level data types for Boolean polynomials and monomials, exponent vectors, as well as for the underlying polynomial rings and subsets of the powerset of the Boolean variables. As a unique approach, binary decision diagrams are used as internal storage type for polynomial structures. On top of this C++-library we provide a Python interface. This allows parsing of complex polynomial systems, as well as sophisticated and extendable strategies for Gröbner base computation. PolyBoRi features a powerful reference implementation for Gröbner basis computation. PolyBoRi is a joint project of the following institutions * Mathematisches Forschungsinstitut Oberwolfach (MFO), Oberwolfach, Germany, * University of Kaiserslautern, Department of Mathematics, Algebra, Geometry and Computer Algebra Group, Kaiserslautern, Germany, and * Fraunhofer Institute for Industrial Mathematics (ITWM), Department of System Analysis, Prognosis and Control, Kaiserslautern, Germany. Release Name: 0.7.0: * Polynomials, monomials, variables, and BooleSets now own a reference to a fully-functionally BoolePolyRing (including ordering) * Orderings can work independently from ring * Simplified interface: remove *Assign() variants from diagrams * Added polybori.nf.simple_nf * Simplification of declare_ring in ipbori * Rename BoolePolynomials::reducibleBy -> BoolePolynomials::firstReducibleBy * Unittests for libpolybori are available, covering 98% of libpolybori * Added experimental PolyGUI * declare_ring uses global context per default