Standard

The complexity of AND—decomposition of Boolean functions. / Emelyanov, Pavel; Ponomaryov, Denis.

In: Discrete Applied Mathematics, Vol. 280, 15.06.2020, p. 113-132.

Research output: Contribution to journal › Article › peer-review

Harvard

Emelyanov, P & Ponomaryov, D 2020, 'The complexity of AND—decomposition of Boolean functions', Discrete Applied Mathematics, vol. 280, pp. 113-132. https://doi.org/10.1016/j.dam.2019.07.005

APA

Emelyanov, P., & Ponomaryov, D. (2020). The complexity of AND—decomposition of Boolean functions. Discrete Applied Mathematics, 280, 113-132. https://doi.org/10.1016/j.dam.2019.07.005

Vancouver

Emelyanov P, Ponomaryov D. The complexity of AND—decomposition of Boolean functions. Discrete Applied Mathematics. 2020 Jun 15;280:113-132. doi: 10.1016/j.dam.2019.07.005

Author

Emelyanov, Pavel ; Ponomaryov, Denis. / The complexity of AND—decomposition of Boolean functions. In: Discrete Applied Mathematics. 2020 ; Vol. 280. pp. 113-132.

BibTeX

@article{323e7552310948bd8fc977c53358024f,
title = "The complexity of AND—decomposition of Boolean functions",
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.",
keywords = "Computational complexity, Conjunctive decomposition, Disjoint decomposition, Polynomial factorization",
author = "Pavel Emelyanov and Denis Ponomaryov",
year = "2020",
month = jun,
day = "15",
doi = "10.1016/j.dam.2019.07.005",
language = "English",
volume = "280",
pages = "113--132",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",

}

RIS

TY - JOUR

T1 - The complexity of AND—decomposition of Boolean functions

AU - Emelyanov, Pavel

AU - Ponomaryov, Denis

PY - 2020/6/15

Y1 - 2020/6/15

N2 - 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.

AB - 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.

KW - Computational complexity

KW - Conjunctive decomposition

KW - Disjoint decomposition

KW - Polynomial factorization

UR - http://www.scopus.com/inward/record.url?scp=85069722555&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2019.07.005

DO - 10.1016/j.dam.2019.07.005

M3 - Article

AN - SCOPUS:85069722555

VL - 280

SP - 113

EP - 132

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

ER -

ID: 21060242