de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Four results on the complexity of VLSI computation

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44907

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45021

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Lengauer, T., & Mehlhorn, K. (1984). Four results on the complexity of VLSI computation. Advances in Computing Research, 2, 1-22.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-AF16-E
Abstract
There is no abstract available