The Area-Time Complexity of Binary Multiplication (Q3912011): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:59, 5 February 2024
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
1981
0 references
chip design
0 references
chip layout
0 references
circuit design
0 references
combinational logic
0 references
lower bounds, VLSI
0 references
