Generating all maximal independent sets of bounded-degree hypergraphs

@inproceedings{Mishra1997GeneratingAM,
  title={Generating all maximal independent sets of bounded-degree hypergraphs},
  author={Nina Mishra and L. Pitt},
  booktitle={COLT '97},
  year={1997}
}
We show 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 (the number of variables) assuming k is some fixed constant. The problem is motivated by the well-studied open problem of enumerating all maximal independent sets of a given hypergraph. Our algorithm gives a solution for the bounded degree case and works even if the hypergraph is not input, but rather only… Expand
A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph
TLDR
It is shown that a well-known sequential approach described by Berge and studied since the 1950s is not polynomial in the above sense, even if an optimal ordering of the edges is allowed. Expand
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
TLDR
Two algorithms are presented for the problem of finding a minimum transversal in a hypergraph of rank 3, also known as the 3-Hitting Set problem, which is a natural extension of the vertex cover problem for ordinary graphs. Expand
New Results on Monotone Dualization and Generating Hypergraph Transversals
TLDR
It is shown that duality of two monotone CNFs can be disproved with limited nondeterminism and feasible in polynomial time with O(log2 n/\log log n) suitably guessed bits. 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
New results on monotone dualization and generating hypergraph transversals
TLDR
It is shown that duality of two monotone CNFs can be disproved with limited nondeterminism, and a number of new polynomial time resp. Expand
All maximal independent sets and dynamic dominance for sparse graphs
TLDR
Algorithms, based on Avis and Fukuda's reverse search paradigm, for listing all maximal independent sets in a sparse graph in polynomial time and delay per output are described and new data structures for maintaining a dynamic vertex set S inA sparse or minor-closed graph family are described. 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
On Frequent Sets of Boolean
Given a Boolean matrix and a threshold t, a subset of the columns is frequent if there are at least t rows having a 1 entry in each corresponding position. This concept is used in the algorithmic,Expand
On Berge Multiplication for Monotone Boolean Dualization
TLDR
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. Expand
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
...
1
2
3
...

References

SHOWING 1-10 OF 33 REFERENCES
A New Algorithm for Generating All the Maximal Independent Sets
TLDR
This paper presents a new efficient algorithm for generating all the maximal independent sets, for which processing time and memory space are bounded by $O(nm\mu)$ and $O (n+m)$, respectively, where n, m, and $\mu$ are the numbers of vertices, edges, and maximalIndependent sets of a graph. Expand
On Generating All Maximal Independent Sets
TLDR
An algorithm is presented that generates all maximal independent sets of a graph in lexicographic order, with only polynomial delay between the output of two successive independent sets, unless P=NP. 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
Exact Learning Boolean Function via the Monotone Theory
  • N. Bshouty
  • Computer Science, Mathematics
  • Inf. Comput.
  • 1995
TLDR
The Monotone Theory is developed that proves (1) Any boolean function is learnable in polynomial time in its minimal disjunctive normal form size, its minimal conjunctive normalform size, and the number of variables n, and (2) Decision trees are learnable. Expand
On Learning Read-k-Satisfy-j DNF
TLDR
An algorithm is presented that for any unknown RkSj D NF formula to be learned, with high probability finds a logically equivalent DNF formula using the well-studied protocol of equivalence and membership queries. Expand
Identifying the Minimal Transversals of a Hypergraph and Related Problems
TLDR
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. Expand
On the Complexity of Inferring Functional Dependencies
TLDR
This work shows that this problem is solvable by a brute-force algorithm in Θ( n 2 2 n p log p ) time for a relation with p rows and n attributes, and proves two exponential lower bounds that hold even for the case where no explicit representation of the dependency set is needed. Expand
On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions
TLDR
It is shown that for some classes of polynomial-time computable monotone Boolean functions it is NP-hard to test either of the conditions D′=D or C′=C, which provides evidence that for each of these classes neither conjunctive nor disjunctive irredundant normal forms can be generated in total (or incremental) quasi-polynomial time. Expand
Learning Boolean Read-Once Formulas over Generalized Bases
TLDR
Any basis class B meeting certain technical conditions can be extended to a polynomial time identification algorithm for read-once formulas over the union of B and the arbitrary functions of constant fan-in. Expand
Oracles and Queries That Are Sufficient for Exact Learning
TLDR
The combinatorial properties that completely determine learnability in this information-theoretic sense are identified and are identified both for membership and for equivalence queries. Expand
...
1
2
3
4
...