On the complexity of planar Boolean circuits (Q1842774)

From MaRDI portal
Revision as of 04:53, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
On the complexity of planar Boolean circuits
scientific article

    Statements

    title
    On the complexity of planar Boolean circuits (English)
    0 references
    author
    György Turán
    0 references
    publication date
    19 July 1995
    0 references
    zbMATH Keywords
    planar graphs
    0 references
    planar circuits
    0 references
    circuit complexity
    0 references

    Identifiers

    DOI
    10.1007/BF01277954
    0 references
    Mathematics Subject Classification ID
    68Q05
    0 references
    68Q25
    0 references
    68R10
    0 references
    94C15
    0 references
    zbMATH DE Number
    746209
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1842774&oldid=26526417"
    Powered by MediaWiki