452
Comment: sf page
|
932
|
Deletions are marked like this. | Additions are marked like this. |
Line 4: | Line 4: |
"PolyBoRi can be understood as a framework of high performance data structures and sample Gröbner bases algorithms." (http://www.itwm.fhg.de/en/as__asprojects__PolyBoRi/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." |
Line 6: | Line 6: |
(http://polybori.sourceforge.net/) | |
Line 8: | Line 9: |
* http://www.itwm.fhg.de/en/as__asprojects__PolyBoRi/PolyBoRi/ * http://www.itwm.fraunhofer.de/zentral/download/berichte/bericht122.pdf |
|
Line 12: | Line 11: |
PolyBoRi is unreleased. | PolyBoRi 0.3.1 is included with Sage 3.0. See the [http://www.sagemath.org/doc/html/ref/module-sage.rings.polynomial.pbori.html reference manual] for details. |
PolyBoRi
Description
"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."
(http://polybori.sourceforge.net/)
Website
Status
PolyBoRi 0.3.1 is included with Sage 3.0.
See the [http://www.sagemath.org/doc/html/ref/module-sage.rings.polynomial.pbori.html reference manual] for details.