Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\) (Q1091140)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\) |
scientific article; zbMATH DE number 4009822
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\) |
scientific article; zbMATH DE number 4009822 |
Statements
Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\) (English)
0 references
1987
0 references
Area-time optimal VLSI division circuits are described for all computation times in the range [\(\Omega\) ((log n)\({}^{1+\epsilon}),O(\sqrt{n})]\) for arbitrary \(\epsilon >0\).
0 references
Area-time optimal VLSI division circuits
0 references
