Algorithmic issues of AND-decomposition of boolean formulas

P. G. Emelyanov, D. K. Ponomaryov

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)

Abstract

AND-decomposition of a boolean formula means finding two (or several) formulas such that their conjunction is equivalent to the given one. Decomposition is called disjoint if the component formulas do not have variables in common. In the paper, we show that deciding AND-decomposability is intractable for boolean formulas given in CNF or DNF and prove tractability of computing disjoint AND-decomposition components of boolean formulas given in positive DNF, Full DNF, and ANF. The latter result follows from tractability of multilinear polynomial factorization over the finite field of order 2, for which we provide a polytime factorization algorithm based on identity testing for partial derivatives of multilinear polynomials.

Original languageEnglish
Pages (from-to)162-169
Number of pages8
JournalProgramming and Computer Software
Volume41
Issue number3
DOIs
Publication statusPublished - 1 May 2015
Externally publishedYes

Fingerprint Dive into the research topics of 'Algorithmic issues of AND-decomposition of boolean formulas'. Together they form a unique fingerprint.

Cite this