2012/03/16 We are proud to announce the release of PolyBoRi 0.8.3 here at sourceforge. Among minor fixes it improves the support of multiple Python installations, comes with consistent library version naming, and easier updating of libm4ri. Binary packages for OpenSuse, Fedora, and Ubuntu are available at the usual place. Updated ebuild scripts for lmona.de and Gentoo-prefix as well as spkg packages for Sage will be available soon.
2012/12/04 PolyBoRi's theorical and algorithmic foundations are described in Michael Brickensteins dissertation. It's available via amazon. Of course many things have also been described in our published articles. But the dissertation gives more details and background.
2012/03/16 Our recent bug-fixing release of PolyBoRi 0.8.2 is available here at sourceforge. We continue to follow the two major goals of the 0.8 branch: stability and compatibility. In addition, for improved supporting of external developers we partially restructured the sources of libpolybori_groebner. Binary packages for OpenSuse, Mandriva, Fedora, Debian and Ubuntu are available at the usual place. Updated ebuild scripts for lmona.de and Gentoo-prefix as well as spkg packages for Sage will be available soon.
2012/03/16 We are proud to announce that PolyBoRi 0.8.1 is available here at sourceforge. We continue to follow the two major goals of the 0.8 branch: stability and compatibility. In addition, for improved supporting of external developers we partially restructured the sources of libpolybori_groebner. Prebuild packages for OpenSuse, Mandriva, Fedora, Debian and Ubuntu are available. Just point your package manager here.
2011/09/08 We are proud to announce the release of PolyBoRi 0.8 here at sourceforge. The main improvement is due to a complete rewriting of the polynomial ring management which avoids errorprone global settings. Also, the support of platforms like cygwin, Darwin and Gentoo-prefix was improved. Prebuild packages for OpenSuse, Mandriva, Fedora, Debian and Ubuntu are available through the Open Build Service.
2011/09/06 PolyBoRi 0.7-2 contains some backports of improvements to PolyBoRi's build system as well as bug fixes originating from upcoming PolyBoRi 0.8 in our download area,
2011/04/27 PolyBoRi 0.7-1 (see here) fixes some issues with compiler flags and improves the package distribution. Also, prebuild rpm packages for some distribution can be found now at the openSuSE build service.
2011/02/25 PolyBoRi 0.7 is released here at Sourgeforge. The release includes a complete rewrite of the Boolean ring management. Also, we added atomic unit tests for libpolybori (98% coverage).
2010/09/01 PolyBoRi is featured in Michael Brickenstein's and Alexander Dreyer's preprint Network-driven Boolean Normal Forms.
2010/06/25 PolyBoRi 0.6.5 includes improved scons-based configuring and an experimental implementation of generalized Boolean rings.
2010/04/01 PolyBoRi is featured in Stanislav Bulygin's and Michael Brickenstein's article Obtaining and Solving Systems of Equations in Key Variables Only for the Small Variants of AES, in Mathematics in Computer Science, Birkhäuser, Basel, pp. 185—200, Volume 3, Issue 2, April 2010, doi: 10.1007/s11786-009-0020-y.
2010/01/29 We release PolyBoRi 0.6.4 with the following main features: The interfaces for variables, monomials and polynomials are more consistent. The scons BOOST_LIBRARY, SHCFLAGS, SHCCFLAGS, and SHCXXFLAGS are customizable now. We improved compatibility with the Sun Studio compiler and hpux.
2009/09/01 PolyBoRi's main reference got published at: Michael Brickenstein and Alexander Dreyer, PolyBoRi: A framework for Gröbner basis computations with Boolean polynomials, Journal of Symbolic Computation, Volume 44, Issue 9 (2009), September 2009, pp. 1326—1345, doi: 10.1016/j.jsc.2008.02.017.
2009/08/01 PolyBoRi is featured in; M. Brickenstein, A. Dreyer, G. Greuel, M. Wedler, O. Wienand, New developments in the theory of Gröbner bases and applications to formal verification, Journal Pure and Applied Algebra, Special issue on Theoretical Effectivity and Practical Effectivity of Gröbner Bases, Volume 213, Issue 8, August 2009, pp. 1612—1635, doi: 10.1016/j.jpaa.2008.11.043.
2009/07/24 PolyBoRi 0.6.3 is comes with an improved interface for Boolean polynomial rings. It also introduced the the modified_linear_algebra for groebner_basis.
2009/07/20 PolyBoRi 0.6.2 includes first steps to improve the Solaris port as well als some bug fixed. Furthermore the Python interface is more PEP8-compliant now and the Gröbner heuristics were improved.
2009/05/15 In order to fix a bug, which caused a critical performance issue during normal form computations, PolyBoRi 0.6.1 is released.
2009/05/08 Finally, PolyBoRi 0.6 is available for download. Many thanks for all comments and remarks!
2009/04/06 The first release candidate of PolyBoRi 0.6 is available for download. It comes with a PEP8-conforming python interface and new algorithms: FGLM and (experimental) parallel processing of Gröbner basis variants. In addition, the documentation was improved considerably: the tutorial is more extensive, and the TeX4ht-Support has been improved. Finally, built-in support for plotting the underlying decision diagrams has been added.
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/09/01 Michael Brickenstein and Alexander Dreyer, Gröbner-free normal forms for boolean polynomials, ISSAC '08: Proceedings of the twenty-first international symposium on symbolic and algebraic computation, Linz/Hagenberg, Austria, ACM, New York, NY, USA (2008), pp. 55—62, doi: 10.1145/1390768.1390779
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.