Directly to content
  1. Publishing |
  2. Search |
  3. Browse |
  4. Recent items rss |
  5. Open Access |
  6. Jur. Issues |
  7. DeutschClear Cookie - decide language by browser settings

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

Borchert, Bernd

[img]
Preview
Postscript, English
Download (393Kb) | Terms of use

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.

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 Deposited: 10 Jun 1999 00:00
Date: 1994
Faculties / Institutes: The Faculty of Mathematics and Computer Science > Department of Mathematics
Subjects: 510 Mathematics
Controlled Keywords: Berechnungskomplexität
About | FAQ | Contact | Imprint |
OA-LogoLogo der Open-Archives-Initiative