On the combinational complexity of certain symmetric Boolean functions (Q4146674): Difference between revisions

@@ Property / author @@
-Larry J. Stockmeyer
@@ Property / author: Larry J. Stockmeyer / rank @@
-Normal rank
@@ Property / author @@
+Larry J. Stockmeyer
@@ Property / author: Larry J. Stockmeyer / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A class of Boolean functions with linear combinational complexity
+Normal rank
@@ Property / cites work @@
+Bounds to Complexities of Networks for Sorting and for Switching
+Normal rank
@@ Property / cites work @@
+Computational Work and Time on Finite Machines
@@ Property / cites work: Computational Work and Time on Finite Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen
+Normal rank
@@ Property / cites work @@
+The combinational complexity of equivalence
@@ Property / cites work: The combinational complexity of equivalence / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01683282
+Normal rank
@@ Property / OpenAlex ID @@
+W1989734466
@@ Property / OpenAlex ID: W1989734466 / rank @@
+Normal rank