Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation (Q3508578): Difference between revisions

@@ 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 @@
+Q3993087
@@ Property / cites work: Q3993087 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
+Normal rank
@@ Property / cites work @@
+Identifying the Minimal Transversals of a Hypergraph and Related Problems
+Normal rank
@@ Property / cites work @@
+On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
+Normal rank
@@ Property / cites work @@
+On the Complexity of Dualization of Monotone Disjunctive Normal Forms
+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 @@
+On the frequency of the most frequently occurring variable in dual monotone DNFs
+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 @@
+An Efficient Algorithm for the Transversal Hypergraph Generation
+Normal rank
@@ Property / cites work @@
+On the complexity of inferring functional dependencies
+Normal rank