Lower bounds for three algorithms for transversal hypergraph generation (Q1028117): Difference between revisions

@@ Property / describes a project that uses @@
+Homology
@@ Property / describes a project that uses: Homology / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2008.10.004
+Normal rank
@@ Property / OpenAlex ID @@
+W1989328905
@@ Property / OpenAlex ID: W1989328905 / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying the Minimal Transversals of a Hypergraph and Related Problems
+Normal rank
@@ Property / cites work @@
+Q4708957
@@ Property / cites work: Q4708957 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
+Normal rank
@@ Property / cites work @@
+Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
+Normal rank
@@ Property / cites work @@
+On enumerating minimal dicuts and strongly connected subgraphs
+Normal rank
@@ Property / cites work @@
+On the complexity of inferring functional dependencies
+Normal rank
@@ Property / cites work @@
+How to assign votes in a distributed system
@@ Property / cites work: How to assign votes in a distributed system / rank @@
+Normal rank
@@ Property / cites work @@
+Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
+Normal rank
@@ Property / cites work @@
+Q4418129
@@ Property / cites work: Q4418129 / rank @@
+Normal rank
@@ Property / cites work @@
+Using Transversals for Discovering XML Functional Dependencies
+Normal rank
@@ Property / cites work @@
+On generating all maximal independent sets
@@ Property / cites work: On generating all maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+NP-completeness: A retrospective
@@ Property / cites work: NP-completeness: A retrospective / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Dualization of Monotone Disjunctive Normal Forms
+Normal rank
@@ Property / cites work @@
+On the complexity of monotone dualization and generating minimal hypergraph transversals
+Normal rank
@@ Property / cites work @@
+New Results on Monotone Dualization and Generating Hypergraph Transversals
+Normal rank
@@ Property / cites work @@
+Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
+Normal rank
@@ Property / cites work @@
+Q3993087
@@ Property / cites work: Q3993087 / rank @@
+Normal rank
@@ Property / cites work @@
+A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for the Transversal Hypergraph Generation
+Normal rank
@@ Property / cites work @@
+On Berge Multiplication for Monotone Boolean Dualization
+Normal rank
@@ Property / cites work @@
+Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices
+Normal rank
@@ Property / cites work @@
+On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
+Normal rank
@@ Property / cites work @@
+On the frequency of the most frequently occurring variable in dual monotone DNFs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1028117