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

thesis

posted on 2014-03-18, 00:00 authored 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

1987-01-01

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

https://uic.figshare.com/account/projects/71123/articles/10916015

Usage metrics

Categories

No categories selected

Keywords

Computer Science.

Licence

Exports