Parity, circuits, and the polynomial-time hierarchy (Q3318683)

From MaRDI portal
Revision as of 03:54, 3 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q55967164, #quickstatements; #temporary_batch_1712111774907)
scientific article
Language Label Description Also known as
English
Parity, circuits, and the polynomial-time hierarchy
scientific article

    Statements

    Parity, circuits, and the polynomial-time hierarchy (English)
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    Boolean circuits
    0 references
    lower bound
    0 references
    parity function
    0 references
    multiplication
    0 references
    transitive closure
    0 references
    polynomial-time hierarchy
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references