Formula complexity of a linear function in a \(k\)-ary basis (Q2037681)

From MaRDI portal
Revision as of 19:37, 30 July 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
Formula complexity of a linear function in a \(k\)-ary basis
scientific article

    Statements

    Formula complexity of a linear function in a \(k\)-ary basis (English)
    0 references
    0 references
    8 July 2021
    0 references
    0 references
    Boolean formulas
    0 references
    linear function
    0 references
    majority function
    0 references
    Khrapchenko method
    0 references
    bipartite graphs
    0 references
    lower bounds for complexity
    0 references