Gröbner-free normal forms for Boolean polynomials

MaRDI QIDQ5301603zbMATH OpenFDO

Authors Michael Brickenstein, Alexander Dreyer

Publication date 20 January 2009

Mathematics Subject Classification ID

Boolean functions (06E30) Symbolic computation and algebraic computation (68W30)

Recommendations

• Gröbner-free normal forms for Boolean polynomials
• Polybori: A framework for Gröbner-basis computations with Boolean polynomials
• Boolean Gröbner bases. Theory, algorithms and applications
• Generating Boolean functions via arithmetic polynomials
• Boolean Gröbner bases

Cited in

(2)

• Gröbner-free normal forms for Boolean polynomials
• _h-Gould-Hopper Appell polynomials

Describes a project that uses

Uses Software

• SINGULAR
• PolyBoRi
• CUDD

This page was built for publication: Gröbner-free normal forms for Boolean polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301603)