Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\)
From MaRDI portal
Publication:1091140
DOI10.1016/0890-5401(87)90034-4zbMath0622.68046OpenAlexW2057199045MaRDI QIDQ1091140
Kurt Mehlhorn, Franco P. Preparata
Publication date: 1987
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(87)90034-4
Related Items (2)
On the VLSI complexity of some arithmetic and numerical problems ⋮ A parametric error analysis of Goldschmidt's division algorithm
Cites Work
This page was built for publication: Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\)
