Schließen
  • search hit 5 of 80
Back to Result List

Algebraic closures in complexity theory

Algebraische Hüllen in der Komplexitätstheorie

Please always quote using this URN: urn:nbn:de:bvb:20-opus-16106
  • We use algebraic closures and structures which are derived from these in complexity theory. We classify problems with Boolean circuits and Boolean constraints according to their complexity. We transfer algebraic structures to structural complexity. We use the generation problem to classify important complexity classes.
  • Algebraische Hüllen und Strukturen, die mit solchen zusammenhängen, werden für die Komplexitätstheorie genutzt. Es werden Probleme im Zusammenhang mit Booleschen Schaltkreisen und Constraint-Satisfaction Problemen komplexitätstheoretisch klassifiziert. Strukturen aus der Algebra werden auf die Strukturelle Komplexität übertragen. Das Generierungsproblem, wird zur Klassifikation wichtiger Komplexitätsklassen benutzt.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics
Metadaten
Author: Elmar Böhler
URN:urn:nbn:de:bvb:20-opus-16106
Document Type:Doctoral Thesis
Granting Institution:Universität Würzburg, Fakultät für Mathematik und Informatik
Faculties:Fakultät für Mathematik und Informatik / Institut für Informatik
Date of final exam:2005/12/16
Language:English
Year of Completion:2005
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
GND Keyword:Komplexitätstheorie
Tag:Clones; Generierungsproblem; Komplexitätstheorie; Postsche Klassen
Clones; Complexity Theory; Generation Problem; Post's Classes
MSC-Classification:03-XX MATHEMATICAL LOGIC AND FOUNDATIONS / 03Dxx Computability and recursion theory / 03D15 Complexity of computation (including implicit computational complexity) [See also 68Q15, 68Q17]
68-XX COMPUTER SCIENCE (For papers involving machine computations and programs in a specific mathematical area, see Section {04 in that areag 68-00 General reference works (handbooks, dictionaries, bibliographies, etc.) / 68Qxx Theory of computing / 68Q15 Complexity classes (hierarchies, relations among complexity classes, etc.) [See also 03D15, 68Q17, 68Q19]
68-XX COMPUTER SCIENCE (For papers involving machine computations and programs in a specific mathematical area, see Section {04 in that areag 68-00 General reference works (handbooks, dictionaries, bibliographies, etc.) / 68Qxx Theory of computing / 68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) [See also 68Q15]
Release Date:2005/12/22
Advisor:Prof. Dr. Klaus Wagner