The Decomposition Tree for analyses of Boolean functions (Q5458074): Difference between revisions

@@ Property / cites work @@
+The Maximum Latency and Identification of Positive Boolean Functions
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank
@@ Property / cites work @@
+Single-faced Boolean Functions and their Minimization
+Normal rank
@@ Property / cites work @@
+Polynomial-time algorithms for generation of prime implicants
+Normal rank
@@ Property / cites work @@
+Q4321736
@@ Property / cites work: Q4321736 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Fourier spectrum of monotone functions
@@ Property / cites work: On the Fourier spectrum of monotone functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3680754
@@ Property / cites work: Q3680754 / rank @@
+Normal rank
@@ Property / cites work @@
+On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
+Normal rank
@@ Property / cites work @@
+Improving the variable ordering of OBDDs is NP-complete
+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 @@
+Q3993546
@@ Property / cites work: Q3993546 / rank @@
+Normal rank