## 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 language | English |
---|---|

Pages (from-to) | 162-169 |

Number of pages | 8 |

Journal | Programming and Computer Software |

Volume | 41 |

Issue number | 3 |

DOIs | |

Publication status | Published - 1 May 2015 |

Externally published | Yes |