A simple sub-quadratic algorithm for computing the subset partial order (Q672836): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(95)00165-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2069684871
@@ Property / OpenAlex ID: W2069684871 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational power of pushdown automata
@@ Property / cites work: On the computational power of pushdown automata / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Perfect Hashing: Upper and Lower Bounds
@@ Property / cites work: Dynamic Perfect Hashing: Upper and Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Three Partition Refinement Algorithms
@@ Property / cites work: Three Partition Refinement Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Opportunistic algorithms for eliminating supersets
+Normal rank
@@ Property / cites work @@
+An old sub-quadratic algorithm for finding extremal sets
+Normal rank
@@ Property / cites work @@
+On Computing the Subset Graph of a Collection of Sets
+Normal rank
@@ Property / cites work @@
+A fast bit-parallel algorithm for computing the subset partial order
+Normal rank
@@ Property / cites work @@
+Finding extremal sets in less than quadratic time
@@ Property / cites work: Finding extremal sets in less than quadratic time / rank @@
+Normal rank