The complexity of a VLSI adder (Q1146001): 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(80)90010-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2015518848 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Regular Layout for Parallel Adders / 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 09:44, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of a VLSI adder |
scientific article |
Statements
The complexity of a VLSI adder (English)
0 references
1980
0 references
VLSI adder
0 references
binary addition
0 references
area-time complexity
0 references
