The Area-Time Complexity of Binary Multiplication (Q3912011)

From MaRDI portal
Revision as of 00:06, 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 Area-Time Complexity of Binary Multiplication
scientific article

    Statements

    title
    The Area-Time Complexity of Binary Multiplication (English)
    0 references
    author
    Richard P. Brent
    0 references
    H. T. Kung
    0 references
    publication date
    1981
    0 references
    zbMATH Keywords
    chip design
    0 references
    chip layout
    0 references
    circuit design
    0 references
    combinational logic
    0 references
    lower bounds, VLSI
    0 references

    Identifiers

    DOI
    10.1145/322261.322269
    0 references
    zbMATH DE Number
    3723849
    0 references
    OpenAlex ID
    W2165495918
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3912011&oldid=32519859"
    Powered by MediaWiki