English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

On the Complexity of VLSI-Computations

MPS-Authors
/persons/resource/persons44907

Lengauer,  Thomas
Computational Biology and Applied Algorithmics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, 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

Lengauer, T., & Mehlhorn, K. (1981). On the Complexity of VLSI-Computations. VLSI Systems and Computations, ?, 89-99.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AF60-6
Abstract
There is no abstract available