On the modulo degree complexity of Boolean functions (Q5918108)

From MaRDI portal
Revision as of 10:54, 12 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7187634
Language Label Description Also known as
English
On the modulo degree complexity of Boolean functions
scientific article; zbMATH DE number 7187634

    Statements

    On the modulo degree complexity of Boolean functions (English)
    0 references
    0 references
    0 references
    7 April 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    Boolean function
    0 references
    degree complexity
    0 references
    polynomial
    0 references
    decision tree complexity
    0 references
    hypergraph property
    0 references