Monotone Circuits for Connectivity Require Super-Logarithmic Depth (Q3472058)

From MaRDI portal
Revision as of 22:02, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Monotone Circuits for Connectivity Require Super-Logarithmic Depth
scientific article

    Statements

    Monotone Circuits for Connectivity Require Super-Logarithmic Depth (English)
    0 references
    0 references
    0 references
    1990
    0 references
    circuit complexity
    0 references
    graph connectivity
    0 references
    complexity of Boolean functions
    0 references
    monotone circuit
    0 references
    undirected graph
    0 references
    communication complexity
    0 references

    Identifiers

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