Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499)

From MaRDI portal
Revision as of 01:33, 7 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q89966425, #quickstatements; #temporary_batch_1707252663060)
scientific article
Language Label Description Also known as
English
Upper bounds on the multiplicative complexity of symmetric Boolean functions
scientific article

    Statements

    Upper bounds on the multiplicative complexity of symmetric Boolean functions (English)
    0 references
    0 references
    0 references
    0 references
    12 May 2020
    0 references
    symmetric Boolean functions
    0 references
    multiplicative complexity
    0 references
    upper bounds
    0 references
    logic minimization
    0 references

    Identifiers