Corrigendum: `` The Area-Time Complexity of Binary Multiplication'' (Q3954824)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Corrigendum: `` The Area-Time Complexity of Binary Multiplication |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Corrigendum: `` The Area-Time Complexity of Binary Multiplication'' |
scientific article |
Statements
Corrigendum: `` The Area-Time Complexity of Binary Multiplication'' (English)
0 references
1982
0 references
chip design
0 references
chip layout
0 references
circuit design
0 references
combinational logic
0 references
lower bounds
0 references
VLSI
0 references
