New results on monotone dualization and generating hypergraph transversals

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 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, in polynomial time with O(log2 n) suitably guessed bits). This result sheds new light on the complexity of this important problem. Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems--Computa

• Type: Conference
• Year: 2002
• Where: STOC
• Authors: Thomas Eiter, Georg Gottlob, Kazuhisa Makino
• Keywords: Algorithms, Associated Decision Problem, Problem Complexity, Prominent Open Problem, STOC 2002