## Abstract

We consider the complexity of decomposing a Boolean function into a conjunction of components, which may share a (possibly empty) given set of variables Δ. Boolean functions are given as expressions in CNF, DNF, full DNF, and ANF and it is assumed that decomposition components must be in the same normal form as the input expression. We show that deciding decomposability is in general intractable for CNF and DNF already for the empty set of shared variables between the components. On the other hand, we demonstrate that for positive CNF and DNF and full DNF, the finest decomposition components wrt a given Δ can be computed in polynomial time (in the size of the input expression given as a string). The tractability results employ an efficient transformation of input expressions into series of expressions in ANFs aka Boolean polynomials, for which we provide a polynomial time factorization algorithm. Since the reduction leads to solving series of factorization tasks for Boolean polynomials, we discuss a number of ideas on how to optimize massive factorization and report preliminary experimental results.

Original language | English |
---|---|

Pages (from-to) | 113-132 |

Number of pages | 20 |

Journal | Discrete Applied Mathematics |

Volume | 280 |

DOIs | |

Publication status | Published - 15 Jun 2020 |

## Keywords

- Computational complexity
- Conjunctive decomposition
- Disjoint decomposition
- Polynomial factorization

## OECD FOS+WOS

- 1.01 MATHEMATICS