The VLSI Complexity of Selected Graph Problems (Q3768399): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/62.70 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982680330 / rank | |||
Normal rank | |||
Latest revision as of 01:51, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The VLSI Complexity of Selected Graph Problems |
scientific article |
Statements
The VLSI Complexity of Selected Graph Problems (English)
0 references
1984
0 references
area-time trade-offs
0 references
VLSI complexity
0 references
