Corpus ID: 14338956

Algorithmic and Computational Complexity Issues of MONET

@inproceedings{Hagen2008AlgorithmicAC,
  title={Algorithmic and Computational Complexity Issues of MONET},
  author={Matthias Hagen},
  year={2008}
}
In this thesis, we study the problem Monet—the Mo(notone) n(ormal form) e(quivalence) t(est)—that asks to decide equivalence of a monotone disjunctive normal form φ and a monotone conjunctive normal form ψ. This problem is a covering problem that can be interpreted as the task of enumerating all (in some sense) minimal solutions of some system. Hence, there is a huge number of similar questions in many problems from diverse applications. Our results can roughly be divided into results on the… Expand
Achieving new upper bounds for the hypergraph duality problem through logic
TLDR
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. Expand
Polynomially solvable cases of hypergraph transversal and related problems
  • I. Rauf
  • Computer Science, Mathematics
  • 2011
TLDR
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. Expand
On the Enumeration of Minimal Hitting Sets in Lexicographical Order
TLDR
It is shown that there is no incremental-polynomial algorithm for the ordered enumeration of minimal hitting sets of a hypergraph, unless P = NP, and a method with delay O(|H|^(k*+2) |V|^2), where k* is the rank of the transversal hypergraph. Expand
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
  • G. Gottlob
  • Mathematics, Computer Science
  • PODS '13
  • 2013
TLDR
It is shown that duality testing for hypergraphs, and thus for monotone DNFs, is feasible in DSPACE(log2 n), i.e., in quadratic logspace, and that whenever, for a Boolean-valued relation, a number of maximal frequent itemsets and anumber of minimal infrequent itemsets are known, then it can be decided in quadRatic log space whether there exist additional frequent or infrequent itemets. Expand
Experimental comparison of the two Fredman-Khachiyan-algorithms
TLDR
This paper experimentally shows algorithm B to be competitive and even superior to algorithm A on many instances, contrasting the assumption that the operations performed by algorithm A to ensure recursion on smaller sub-problems do only pay off theoretically. Expand
Enumeration Complexity
TLDR
This column focuses on the structural complexity of enumeration, trying to capture di↵erent notions of tractability and the beautiful algorithmic methods used to solve enumeration problems. Expand
Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
TLDR
It is shown that none of the new algorithms improving the sequential method is output-polynomial, by proving lower bounds for all three algorithms. Expand
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling
TLDR
An enumeration method for inclusion-wise minimal hitting sets in hypergraphs that has delay O(mk* +1 · n2) and uses linear space is devised, and empirical evidence is provided showing that the enumeration outperforms the theoretical worst-case guarantee on hyper graphs arising in the profiling of relational databases. Expand
Efficient algorithms for dualizing large-scale hypergraphs
TLDR
A new set system induced by the minimality condition of the hitting sets, that enables us to use efficient pruning methods and to construct time efficient and polynomial space dualization algorithms. Expand
Compression with wildcards: All exact, or all minimal hitting sets
  • M. Wild
  • Mathematics, Computer Science
  • ArXiv
  • 2020
TLDR
Preliminary numerical experiments show that traditional one-by-one enumeration schemes cannot compete against compressed enumeration when the degree of compression is high, and several tools to enhance compression are put in place and their pros and cons are evaluated. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 309 REFERENCES
Logarithmic Space Instances of Monotone Normal Form Equivalence Testing
We examine the problem Mone—given a monotone DNF and a monotone CNF, decide whether they are equivalent. The exact complexity of Mone is a long standing open problem. On the one hand, Mone isExpand
Computational aspects of monotone dualization: A brief survey
TLDR
This paper focuses on the famous paper by Fredman and Khachiyan, which showed that the dualization of monotone disjunctive normal forms is solvable in quasi-polynomial time (and thus most likely not co-NP-hard), as well as on follow-up works. Expand
Monotone Boolean dualization is in co-NP[log2n]
TLDR
A modified version of Fredman and Khachiyan's algorithm requires deterministic polynomial time plus O( log2 n) nondeterministic guesses, thus placing the problem in the class co-NP[log2 n]. Expand
Self-Duality of Bounded Monotone Boolean Functions and Related Problems
TLDR
The equivalence between the problem of determining self-duality of a boolean function in DNF and a special type of satisfiability problem called NAESPI is shown and it is shown that c-bounded NAesPI can be solved in polynomial time when c is some constant. Expand
On the complexity of monotone dualization and generating minimal hypergraph transversals
TLDR
The decomposition technique can be thought of as a generalization of that of Fredman and Khachiyan, and yields stronger bounds on the sequential complexity of the problem in the case when the sizes of f and g are significantly different, and allows for generating all minimal transversals of a given hypergraph using only polynomial space. Expand
Complexity of DNF minimization and isomorphism testing for monotone formulas
TLDR
It is shown that calculating the minimum equivalent DNF for a monotone formula is possible in output-polynomial time if and only if P=NP, and that checking whether two formulas are isomorphic has the same complexity for arbitrary formulas as for monot one formulas. Expand
Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
TLDR
It is shown that it is possible to apply ideas of Paull and Unger and of Tsukiyama et al. to obtain polynomial-time algorithms for a number of special cases, e.g. the efficient generation of all maximal feasible solutions to a knapsack problem. Expand
Polynominal Time Algorithms for Some Self-Duality Problems
TLDR
This paper exhibits polynomial time algorithms for testing self-duality for several natural classes of formulas where the problem was not known to be solvable. Expand
Generating dual-bounded hypergraphs
TLDR
This article surveys some recent results on the generation of implicitly given hypergraphs and their applications in Boolean and integer programming, data mining, reliability theory, and combinatorics and considers the problem of incrementally generating the family F π of all minimal subsets satisfying property ~. Expand
Complexity of DNF and Isomorphism of Monotone Formulas
TLDR
It is shown that calculating the minimal DNF for a monotone formula is possible in output-polynomial time if and only if P = NP, and disprove a conjecture by showing that checking whether two formulas are isomorphic has the same complexity for arbitrary formulas as formonotone formulas. Expand
...
1
2
3
4
5
...