Factorization of Boolean polynomials: parallel algorithms and experimental evaluation

DOI10.1134/S0361768821020043zbMath1474.68463OpenAlexW3155680069MaRDI QIDQ2027854

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)

Related Items (1)

The complexity of AND-decomposition of Boolean functions

Uses Software

• CUDD
• GitHub

Cites Work

• Algorithmic issues of AND-decomposition of Boolean formulas
• On a polytime factorization algorithm for multilinear polynomials over \(\mathbb{F}_2\)
• A polynomial Time Delta-Decomposition algorithm for positive DNFs
• Modern Computer Algebra
• On Tractability of Disjoint AND-Decomposition of Boolean Formulas
• On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors

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