Four results on the complexity of VLSI computations

Lengauer, Thomas; Mehlhorn, Kurt

Local TagsRelease HistoryDetailsSummary

Four results on the complexity of VLSI computations

Lengauer, T., & Mehlhorn, K. (1983). Four results on the complexity of VLSI computations.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AF27-8 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AF28-6

Genre: Other

Files

show Files

Locators

show

Creators

show

hide

Creators:
Lengauer, Thomas¹, Author
Mehlhorn, Kurt², Author

Affiliations:
1Computational Biology and Applied Algorithmics, MPI for Informatics, Max Planck Society, ou_40046
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2006-09-22Date issued: 1983

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 344621
Other: Local-ID: C1256428004B93B8-99C7B98D9AA68535C12571C0003DEF2B-mehlhorn83a

Degree: -

Event

show

Legal Case

show

Project information

show

Source

show