A Polytime Delta-Decomposition Algorithm for Positive DNFs

05/21/2018

∙

by   Denis Ponomaryov, et al.

∙

0

∙

share

We consider the problem of decomposing a given positive DNF into a conjunction of DNFs, which may share a (possibly empty) given set of variables Delta. This problem has interesting connections with minimization of relations, as well as with traditional applications of positive DNFs such as, e.g, game theory. We show that the finest Delta-decomposition components of a positive DNF can be computed in polytime and provide a decomposition algorithm based on factorization of multilinear boolean polynomials