New Results on Monotone Dualization and Generating Hypergraph Transversals

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, respectively, output-polynomial time results for signif...

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on computing Vol. 32; no. 2; pp. 514 - 537
Main Authors:	Eiter, Thomas, Gottlob, Georg, Makino, Kazuhisa
Format:	Journal Article
Language:	English
Published:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2003
Subjects:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Boolean Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Exact sciences and technology Game theory Graph theory Graphs Information systems. Data bases Mathematical programming Mathematics Memory organisation. Data processing Order, lattices, ordered algebraic structures Sciences and techniques of general use Software Theoretical computing Variables Hypergraph Knowledge representation Boolean function Duality Computing Non determinism Polynomial time Treewidth Combinatorial enumeration Output polynomial algorithm Database Transversal computation NP complete problem Acyclic graph Algorithm analysis
ISSN:	0097-5397, 1095-7111
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!