On the complexity of monotone circuits for threshold symmetric Boolean functions (Q2064376)

From MaRDI portal
Revision as of 16:22, 27 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of monotone circuits for threshold symmetric Boolean functions
scientific article

    Statements

    On the complexity of monotone circuits for threshold symmetric Boolean functions (English)
    0 references
    0 references
    5 January 2022
    0 references
    0 references
    monotone circuits
    0 references
    complexity
    0 references
    symmetric Boolean functions
    0 references
    threshold functions
    0 references
    0 references
    0 references