The VLSI Complexity of Selected Graph Problems (Q3768399)

From MaRDI portal
Revision as of 01:51, 20 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
The VLSI Complexity of Selected Graph Problems
scientific article

    Statements

    title
    The VLSI Complexity of Selected Graph Problems (English)
    0 references
    publication date
    1984
    0 references
    zbMATH Keywords
    area-time trade-offs
    0 references
    VLSI complexity
    0 references
    author
    Joseph F. Ja'Ja'
    0 references

    Identifiers

    DOI
    10.1145/62.70
    0 references
    zbMATH DE Number
    4026825
    0 references
    OpenAlex ID
    W1982680330
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3768399&oldid=32671555"
    Powered by MediaWiki