Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables (Q895458): Difference between revisions

@@ Property / cites work @@
+Q3249579
@@ Property / cites work: Q3249579 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3340780
@@ Property / cites work: Q3340780 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5445419
@@ Property / cites work: Q5445419 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for the construction of polynomials modulo k for k-valued functions for composite k
+Normal rank
@@ Property / cites work @@
+A class of Boolean functions with linear combinational complexity
+Normal rank
@@ Property / cites work @@
+Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen
+Normal rank
@@ Property / cites work @@
+Q3758729
@@ Property / cites work: Q3758729 / rank @@
+Normal rank