Factorization of Boolean polynomials: parallel algorithms and experimental evaluation

DOI10.1134/S0361768821020043MaRDI QIDQ2027854zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 28 May 2021

Published in Programming and Computer Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0361768821020043

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10) Polynomials, factorization in commutative rings (13P05)

Recommendations

• On a polytime factorization algorithm for multilinear polynomials over \(\mathbb{F}_2\)
• Factoring Boolean functions using graph partitioning
• Certain problems associated with Boolean polynomials
• Factoring a binary polynomial of degree over one million
• A MIMD implementation of the Buchberger algorithm for Boolean polynomials

Cites work

• A polynomial Time Delta-Decomposition algorithm for positive DNFs
• Algorithmic issues of AND-decomposition of Boolean formulas
• Modern computer algebra
• On a polytime factorization algorithm for multilinear polynomials over \(\mathbb{F}_2\)
• On the relation between polynomial identity testing and finding variable disjoint factors
• On tractability of disjoint AND-decomposition of Boolean formulas

Cited in

(6)

• scientific article; zbMATH DE number 4006369 (Why is no real title available?)
• Factoring logic functions
• scientific article; zbMATH DE number 4133979 (Why is no real title available?)
• On a polytime factorization algorithm for multilinear polynomials over \(\mathbb{F}_2\)
• The complexity of AND-decomposition of Boolean functions
• Factoring Boolean functions using graph partitioning

Describes a project that uses

Uses Software

• GitHub
• CUDD

This page was built for publication: Factorization of Boolean polynomials: parallel algorithms and experimental evaluation

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