PolyBoRi - Polynomials over Boolean Rings

About 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.

Project News

2008/09/23 PolyBoRi 0.5 comes with a revised python interface. Also, some license issues were resolved as well as more standard conforming features regarding doxygen, scons, and debianization. Finally, the M4Ri-implementation was updated, and an external M4RI library may be used.

2008/05/13 The next beta PolyBoRi 0.4 is available for download. This release contains several bug and stability fixes as well as better (more standard-conforming) debian support (see the pkgs/debian directory). A more exhaustive tutorial, new python modules, and a new version of M4RI was added. Also, PolyBoRi was relicensed under GPL2 or higher.

2008/03/13 Minor fixes were included in the PolyBoRi 0.3.1 release, which is available for download now.

2008/03/07 Our most recent beta PolyBoRi 0.3 is now available in the download area. This release contains several stability improvements, in particular, low-level procedures do not depend on the active ring any more. In addition, python-related settings during build-process were simplified. Also, the support of rpm and Debian packages is more standard conforming.

2008/02/22 Our second beta PolyBoRi 0.2 is now available for download. It comes with refined and more stable Gröbner algorithms. Also, new procedures for interpolation of Boolean polynomials have been added and the overall documentation was extented considerably. A preliminary support of rpm and Debian packages is also available.

2008/02/19 The second release candidate of PolyBoRi 0.2 is available in the download area. The most important additions are the support of rpms and several new sections of the tutorial.

2008/02/04 The first release candidate of PolyBoRi 0.2 is available in the download area. This version comes with refined Gröbner algorithms and several stability improvements. Also new procedures for interpolation of Boolean polynomials have been added.

2007/12/16 PolyBoRi 0.1 was integrated into SAGE by the community. PolyBoRi's Boolean Ring an Gröbner basis functionality is available in Sage 2.9 or later.

2007/11/23 PolyBoRi 0.1 Download Pages. We proudly announce the availability of PolyBoRi 0.1, the first publicly available beta of our framework for computations with polynomials in Boolean rings. PolyBoRi is open source. It is released to the public under the terms of the GNU Public License (GPL), version 3 or later.