Contributions to Proceedings:
T. Eiter, G. Gottlob, K. Makino:
"New Results on Monotone Dualization and Generating Hypergraph Transversals";
in: "Proceedings of the 34th annual ACM Symposium on Theory of computing",
J. Reif (ed.);
New York, NY, USA,
This paper considers 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 fo 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, in polynomial time with O(log2n) suitably guessed bits). This result sheds new light on the complexity of this important problem.
Created from the Publication Database of the Vienna University of Technology.