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â€¦ (More)

Disjoint AND-decomposition of a boolean formula means its representation as a conjunction of two (or several) formulas having disjoint sets of variables. We show that deciding AND-decomposability isâ€¦ (More)

We consider the Cartesian decomposition of relational data sets, i.e. the problem of finding two or several data sets such that their unordered Cartesian product equals the source set. In terms ofâ€¦ (More)

Decomposition of boolean functions is an important research topic having a long history and a wide range of applications in the logic circuit synthesis, (hyper)graph/game theory, and combinatorialâ€¦ (More)

In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomialâ€¦ (More)

In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomialâ€¦ (More)

In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomialâ€¦ (More)