The Area-Time Complexity of Binary Multiplication (Q3912011)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The Area-Time Complexity of Binary Multiplication
scientific article

    Statements

    The Area-Time Complexity of Binary Multiplication (English)
    0 references
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    chip design
    0 references
    chip layout
    0 references
    circuit design
    0 references
    combinational logic
    0 references
    lower bounds, VLSI
    0 references
    0 references