Algebraic closures in complexity theory

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.

Level thesis:degree_level

thesis.doctoral

Grantor dc:publisher

Universität Würzburg

Year

2005

Author dc:creator

• Böhler, Elmar

Contributors dc:contributor

• Wagner, Klaus

• Komplexitätstheorie
• Clones
• Generierungsproblem
• Postsche Klassen
• Complexity Theory
• Generation Problem
• Post's Classes

Repository record source_url

https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/1369

OAI identifier oai:identifier

oai:opus.bibliothek.uni-wuerzburg.de:1369