On the complexity of planar Boolean circuits (Q1842774)

From MaRDI portal
Revision as of 07:37, 28 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
On the complexity of planar Boolean circuits
scientific article

    Statements

    On the complexity of planar Boolean circuits (English)
    0 references
    0 references
    19 July 1995
    0 references
    planar graphs
    0 references
    planar circuits
    0 references
    circuit complexity
    0 references

    Identifiers

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