The complexity of the majority rule on planar graphs (Q2255002)

From MaRDI portal
Revision as of 16:59, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of the majority rule on planar graphs
scientific article

    Statements

    The complexity of the majority rule on planar graphs (English)
    0 references
    0 references
    0 references
    6 February 2015
    0 references
    automata networks
    0 references
    computational complexity
    0 references
    majority
    0 references
    P-completeness
    0 references
    NC
    0 references
    planar graph
    0 references

    Identifiers

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