The minimum equivalent DNF problem and shortest implicants (Q1604210): Difference between revisions

@@ Property / OpenAlex ID @@
+W2046132190
@@ Property / OpenAlex ID: W2046132190 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of some classical equivalence relations on boolean functions
+Normal rank
@@ Property / cites work @@
+On the Amount of Nondeterminism and the Power of Verifying
+Normal rank
@@ Property / cites work @@
+Two-level logic minimization: an overview
@@ Property / cites work: Two-level logic minimization: an overview / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of bounded nondeterminism
@@ Property / cites work: Classes of bounded nondeterminism / rank @@
+Normal rank
@@ Property / cites work @@
+A Learning Network Using Adaptive Threshold Elements
+Normal rank
@@ Property / cites work @@
+Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
+Normal rank
@@ Property / cites work @@
+On limited nondeterminism and the complexity of the V-C dimension
+Normal rank
@@ Property / cites work @@
+The Problem of Simplifying Truth Functions
@@ Property / cites work: The Problem of Simplifying Truth Functions / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time algorithms for generation of prime implicants
+Normal rank
@@ Property / cites work @@
+More complicated questions about maxima and minima, and some closures of NP
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank