On the VLSI complexity of some arithmetic and numerical problems (Q1103401)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4053023
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the VLSI complexity of some arithmetic and numerical problems |
scientific article; zbMATH DE number 4053023 |
Statements
On the VLSI complexity of some arithmetic and numerical problems (English)
0 references
1987
0 references
We present a survey of complexity results which arise in VLSI theory, when dealing with numerical computations. The VLSI model of computation is briefly described, and the corresponding complexity measures are presented. VLSI designs for the solution of some important arithmetic and numerical problems are also shown.
0 references
numerical computations
0 references
VLSI model of computation
0 references
complexity measures
0 references
0 references
0 references
0.7878283858299255
0 references
