## New Results on Monotone Dualization and Generating Hypergraph Transversals (2002)

### Cached

### Download Links

- [www.kr.tuwien.ac.at]
- [www.kr.tuwien.ac.at]
- [www.kr.tuwien.ac.at]
- [arxiv.org]
- [arxiv.org]
- [arxiv.org]
- [www.kr.tuwien.ac.at]
- DBLP

### Other Repositories/Bibliography

Venue: | SIAM JOURNAL ON COMPUTING |

Citations: | 37 - 12 self |

### BibTeX

@INPROCEEDINGS{Eiter02newresults,

author = {Thomas Eiter and Georg Gottlob and Kazuhisa Makino},

title = {New Results on Monotone Dualization and Generating Hypergraph Transversals},

booktitle = {SIAM JOURNAL ON COMPUTING},

year = {2002},

pages = {14--22},

publisher = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

We consider the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent open problem in NP-completeness. We present a number of new polynomial time resp. output-polynomial time results for significant cases, which largely advance the tractability frontier and improve on previous results. Furthermore, we show that duality of two monotone CNFs can be disproved with limited nondeterminism. More precisely, this is feasible in polynomial time with O(log² n/log log n) suitably guessed bits. This result sheds new light on the complexity of this important problem.