A linear time equivalence test for read-twice DNF formulas (Q1334630): Difference between revisions

@@ Property / cites work @@
+Q4230377
@@ Property / cites work: Q4230377 / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraic Structures with Hard Equivalence and Minimization Problems
+Normal rank
@@ Property / cites work @@
+Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4160379
@@ Property / cites work: Q4160379 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3742714
@@ Property / cites work: Q3742714 / rank @@
+Normal rank
@@ Property / cites work @@
+Read-twice DNF formulas are properly learnable
@@ Property / cites work: Read-twice DNF formulas are properly learnable / rank @@
+Normal rank
@@ Property / cites work @@
+A theory of the learnable
@@ Property / cites work: A theory of the learnable / rank @@
+Normal rank