The VLSI Complexity of Selected Graph Problems (Q3768399)

From MaRDI portal
Revision as of 17:09, 27 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1365678)
scientific article
Language Label Description Also known as
English
The VLSI Complexity of Selected Graph Problems
scientific article

    Statements

    title
    The VLSI Complexity of Selected Graph Problems (English)
    0 references
    DOI
    10.1145/62.70
    0 references
    publication date
    1984
    0 references
    zbMATH DE Number
    4026825
    0 references
    zbMATH Keywords
    area-time trade-offs
    0 references
    VLSI complexity
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3768399&oldid=22780281"
    Powered by MediaWiki