Area-time optimal VLSI networks for multiplying matrices (Q1145672): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: The Area-Time Complexity of Binary Multiplication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(80)90006-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057982630 / rank | |||
Normal rank | |||
Latest revision as of 09:55, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Area-time optimal VLSI networks for multiplying matrices |
scientific article |
Statements
Area-time optimal VLSI networks for multiplying matrices (English)
0 references
1980
0 references
optimal VLSI networks
0 references
matrix multiplication
0 references
area-time complexity
0 references
