University of Illinois at ChicagoBrowse

File(s) not publicly available

LOWER BOUNDS ON COMPUTATION TIME FOR VARIOUS MODELS IN COMPUTATIONAL COMPLEXITY THEORY.

thesis
posted on 18.03.2014, 00:00 by MARTIN JOHANNES. DIETZFELBINGER
LOWER BOUNDS ON COMPUTATION TIME FOR VARIOUS MODELS IN COMPUTATIONAL COMPLEXITY THEORY.

History

Degree Grantor

University of Illinois at Chicago.

Degree Level

Doctoral

Language

en

Issue date

01/01/1987

File(s) available to UIC only. Log in with UIC Net ID to access:

Usage metrics

Categories

Keywords

Computer Science.

Licence

In Copyright

Exports