Amplifying circuit lower bounds against polynomial time, with applications (Q354644)

From MaRDI portal
Revision as of 16:16, 6 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
Amplifying circuit lower bounds against polynomial time, with applications
scientific article

    Statements

    Amplifying circuit lower bounds against polynomial time, with applications (English)
    0 references
    0 references
    0 references
    19 July 2013
    0 references
    0 references
    circuit evaluation
    0 references
    quantified Boolean formulas
    0 references
    lower bounds
    0 references
    NC
    0 references
    size-depth trade-offs
    0 references
    0 references