On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization

  title={On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization},
  author={Khaled M. Elbassioni},
Given the irredundant CNF representation Φ of a monotone Boolean function f: {0, 1} n → {0,1}, the dualization problem calls for finding the corresponding unique irredundant DNF representation ψ of f. The (generalized) multiplication method works by repeatedly dividing the clauses of Φ into (not necessarily disjoint) groups, multiplying-out the clauses in each group, and then reducing the result by applying the absorption law. We present the first non-trivial upper-bounds on the complexity of… 

On Berge Multiplication for Monotone Boolean Dualization

Weshow that for any monotone CNF φ, Berge multiplication can be done in subexponential time, and for many interestingsubclasses of monotones C NF's such as CNF's with bounded size, bounded degree, bounded intersection, bounded conformality, and read-once formula, it can bedone in polynomial or quasi-polynomialtime.

Achieving new upper bounds for the hypergraph duality problem through logic

This paper develops a new nondeterministic algorithm for DUAL that requires to guess O(log2 n) bits and forms its deterministic part in FO(COUNT), i.e., first order logic augmented by counting quantifiers.

On the complexity of monotone dualization and generating minimal hypergraph transversals

Algorithmic and Computational Complexity Issues of MONET

Several restricted classes of Monet are shown to be solvable in logarithmic space, which improves previously known polynomial time bounds and shows Monet to be in the complexity class of fixed-parameter tractable problems with respect to several parameters.

Polynomially solvable cases of hypergraph transversal and related problems

The hypergraph transversal problem is shown to be solvable in output polynomial time for a number of hypergraph classes, and tight sublinear upper bounds on the readability of a monotone Boolean function given in CNF (or DNF) form are given, parameterized by the number of terms in the CNF and the maximum number of variables in the intersection of any constant number of Terms.

A Fast and Simple Parallel Algorithm for the Monotone Duality Problem

A fast and simple parallel algorithms are constructed for the monotone duality problem, that run in polylogarithmic time by using quasi-polynomially many processors and improves over the previously best known bound on the sequential time complexity of the problem.

Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation

It is shown that none of the new algorithms improving the sequential method is output-polynomial, by proving lower bounds for all three algorithms.

Lower bounds for three algorithms for transversal hypergraph generation

A Lower Bound for the HBC Transversal Hypergraph Generation

A superpolynomial lower bound for the HBC-algorithm is proved and is shown to be correct, which shows that the originally claimed upper bound on the H BC-al algorithm's running time is wrong.



Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries

An incremental output polynomial time algorithm is given for exact learning both the read-k CNF and (not necessarily read restricted) DNF descriptions of f, the only method of obtaining information about f through membership queries.

Complexity of Identification and Dualization of Positive Boolean Functions

It is shown that the existence of an incrementally polynomial algorithm for this problem is equivalent to the exist of the following algorithms, where ƒ and g are positive Boolean functions.

Exact Transversal Hypergraphs and Application to Boolean µ-Functions

It is shown that hypergraphs are recognizable in polynomial time and that their minimal transversals as well as their maximal independent sets can be generated in lexicographic order withPolynomial delay between subsequent outputs, which is impossible in the general case unless P= NP.

A New Algorithm for the Hypergraph Transversal Problem

A new decomposition technique is given for solving the problem of finding all minimal transversals of a hypergraph, given by an explicit list of its hyperedges, with the following advantages: global parallelism, and new results on the complexity of generating minimalTransversals for new classes of hypergraphs, namely hyper graphs of bounded dual-conformality, andhypergraphs in which every edge intersects every minimaltransversal in a bounded number of vertices.

Dual subimplicants of positive Boolean functions

It follows that the co-ocurrence graph of the dual of a positive Boolean function can be always generated in time polynomial in the size of the function.

Transversal Hypergraphs and Families of Polyhedral Cones

We discuss the complexity of generating certain geometric configurations related to the classical theorems of Caratheodory and Helly. Given a set K of rational cones in n dimensions and a rational

New results on monotone dualization and generating hypergraph transversals

It is shown that duality of two monotone CNFs can be disproved with limited nondeterminism, and a number of new polynomial time resp.

Generating all maximal independent sets of bounded-degree hypergraphs

This work shows that any monotone function with a read-k CNF representation can be learned in terms of its DNF representation with membership queries alone in time polynomial in the DNF size and n assuming k is some fixed constant.

On the Complexity of Some Enumeration Problems for Matroids

An incremental polynomial-time algorithm for enumerating all minimal (maximal) subsets of a matroid defined by an independence oracle on ground set S which span (do not span) $A$.

Identifying the Minimal Transversals of a Hypergraph and Related Problems

Two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, are considered and their significance for several search problems in applied computer science is discussed.