A well-mixed function with circuit complexity $5n$: tightness of the Lachish-Raz-type bounds (Q2430008): 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.1016/j.tcs.2010.12.040
+Normal rank
@@ Property / OpenAlex ID @@
+W1949948240
@@ Property / OpenAlex ID: W1949948240 / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial method and restricted sums of congruence classes
+Normal rank
@@ Property / cites work @@
+Q4938624
@@ Property / cites work: Q4938624 / 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 @@
+On the addition of residue classes mod p
@@ Property / cites work: On the addition of residue classes mod p / rank @@
+Normal rank
@@ Property / cites work @@
+Q5772619
@@ Property / cites work: Q5772619 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4708583
@@ Property / cites work: Q4708583 / rank @@
+Normal rank
@@ Property / cites work @@
+Entropy of contact circuits and lower bounds on their complexity
+Normal rank
@@ Property / cites work @@
+Asymptotically Optimal Circuit for a Storage Access Function
+Normal rank
@@ Property / cites work @@
+Explicit lower bound of             <i>4.5n - o(n)</i>             for boolena circuits
+Normal rank
@@ Property / cites work @@
+Cyclic Spaces for Grassmann Derivatives and Additive Theory
+Normal rank
@@ Property / cites work @@
+Q4287364
@@ Property / cites work: Q4287364 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank
@@ Property / cites work @@
+Branching Programs and Binary Decision Diagrams
@@ Property / cites work: Branching Programs and Binary Decision Diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+A $4n$ Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2430008

A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds (Q2430008): Difference between revisions

Latest revision as of 22:16, 3 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)