A nonlinear lower bound on the practical combinational complexity (Q5096789): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-55210-3_191
+Normal rank
@@ Property / OpenAlex ID @@
+W1526667530
@@ Property / OpenAlex ID: W1526667530 / rank @@
+Normal rank
@@ Property / cites work @@
+A Boolean function requiring 3n network size
@@ Property / cites work: A Boolean function requiring 3n network size / rank @@
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit constructions of linear-sized superconcentrators
+Normal rank
@@ Property / cites work @@
+A class of Boolean functions with linear combinational complexity
+Normal rank
@@ Property / cites work @@
+The advantages of a new approach to defining the communication complexity for VLSI
+Normal rank
@@ Property / cites work @@
+Q3787930
@@ Property / cites work: Q3787930 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3832044
@@ Property / cites work: Q3832044 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonlinear lower bounds on the number of processors of circuits with sublinear separators
+Normal rank
@@ Property / cites work @@
+Q3835036
@@ Property / cites work: Q3835036 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5567891
@@ Property / cites work: Q5567891 / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3684035
@@ Property / cites work: Q3684035 / rank @@
+Normal rank
@@ Property / cites work @@
+The planar realization of Boolean functions
@@ Property / cites work: The planar realization of Boolean functions / rank @@
+Normal rank
@@ Property / cites work @@
+A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions
+Normal rank
@@ Property / cites work @@
+Communication complexity
@@ Property / cites work: Communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q3340780
@@ Property / cites work: Q3340780 / rank @@
+Normal rank
@@ Property / cites work @@
+Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen
+Normal rank
@@ Property / cites work @@
+A 3n-lower bound on the network complexity of Boolean functions
+Normal rank
@@ Property / cites work @@
+Lower bounds for synchronous circuits and planar circuits
+Normal rank
@@ Property / cites work @@
+Q3326832
@@ Property / cites work: Q3326832 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank