Lower Bounds for the Size of Nondeterministic Circuits (Q3196391): Difference between revisions

@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / 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 @@
+An Elementary Proof of a 3n − o(n) Lower Bound on the Circuit Complexity of Affine Dispersers
+Normal rank
@@ Property / cites work @@
+Q4708583
@@ Property / cites work: Q4708583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258580
@@ Property / cites work: Q4258580 / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit lower bound of             <i>4.5n - o(n)</i>             for boolena circuits
+Normal rank
@@ Property / cites work @@
+Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen
+Normal rank
@@ Property / cites work @@
+Q5604434
@@ Property / cites work: Q5604434 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-theoretic properties in computational complexity
+Normal rank