Where-oblivious is not sufficient (Q786531): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users 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.1016/0020-0190(83)90111-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2070055612 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Information transfer and area-time tradeoffs for VLSI multiplication / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Area-Time Complexity of Binary Multiplication / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:29, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Where-oblivious is not sufficient |
scientific article |
Statements
Where-oblivious is not sufficient (English)
0 references
1983
0 references
VLSI models
0 references
lower bounds
0 references
crossing sequences
0 references
I/O schedule
0 references
