English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Area-Time Optimal Division for $T=\Omega((\log n)^1+\epsilon)$

MPS-Authors
/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Preparata,  Franco P.
Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Mehlhorn, K., & Preparata, F. P. (1987). Area-Time Optimal Division for $T=\Omega((\log n)^1+\epsilon)$. Information and Computation, 72, 270-282.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AEA4-3
Abstract
Area-time optimal VLSI division circuits are described for all computation times in the range for arbitrary > 0.