The Area-Time Complexity of Binary Multiplication (Q3912011): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/322261.322269 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2165495918 / rank | |||
Normal rank | |||
Latest revision as of 00:06, 20 March 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
