Complexity lower bound for Boolean functions in the class of extended operator forms (Q2306843)

From MaRDI portal
Revision as of 22:30, 2 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity lower bound for Boolean functions in the class of extended operator forms
scientific article

    Statements

    Complexity lower bound for Boolean functions in the class of extended operator forms (English)
    0 references
    26 March 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    Boolean function
    0 references
    lower bound
    0 references
    extension of finite field
    0 references
    Mersenne prime
    0 references