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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The polynomial method and restricted sums of congruence classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Boolean function requiring 3n network size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the addition of residue classes mod p / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5772619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy of contact circuits and lower bounds on their complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Optimal Circuit for a Storage Access Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit lower bound of <i>4.5n - o(n)</i> for boolena circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Spaces for Grassmann Derivatives and Additive Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4287364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Programs and Binary Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $4n$ Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions / rank
 
Normal rank

Latest revision as of 23:16, 3 July 2024

scientific article
Language Label Description Also known as
English
A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds
scientific article

    Statements

    A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds (English)
    0 references
    0 references
    0 references
    5 April 2011
    0 references
    0 references
    Boolean functions
    0 references
    circuit complexity
    0 references
    upper bound
    0 references
    0 references