Predicate Classes, Promise Classes, and the Acceptance Power of Regular Languages

Borchert, Bernd

Postscript, English
Terms of use / Nutzungsbedingungen
Download (393Kb)

Citation of documents: Please do not cite the URL that is displayed in your browser location input, instead use the persistent URL or the URN below, as we can guarantee their long-time accessibility.

URN: urn:nbn:de:bsz:16-opus-84
URL: http://www.ub.uni-heidelberg.de/archiv/8

Abstract

Die Dissertation untersucht eine uniforme Methode, Komplexitaetsklassen zu definieren.

Translation of abstract (English)

The thesis studies a uniform method to define complexity classes.

Item Type:	Dissertation
Date of thesis defense:	20 December 1994
Date:	1994
Faculties / Institutes:	The Faculty of Mathematics and Computer Science > Department of Mathematics
Subjects:	510 Mathematics
Controlled Keywords:	Berechnungskomplexität