The conjunctive complexity of quadratic Boolean functions (Q808253)

From MaRDI portal
Revision as of 18:15, 21 June 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
The conjunctive complexity of quadratic Boolean functions
scientific article

    Statements

    The conjunctive complexity of quadratic Boolean functions (English)
    0 references
    0 references
    0 references
    1991
    0 references
    0 references
    circuit complexity
    0 references
    monotone circuits
    0 references
    quadratic Boolean functions
    0 references
    single level complexity
    0 references
    NP complete
    0 references
    conjunctive complexity
    0 references
    0 references