Refine
Has Fulltext
- yes (1) (remove)
Is part of the Bibliography
- yes (1)
Year of publication
- 2005 (1) (remove)
Document Type
- Doctoral Thesis (1)
Language
- English (1)
Keywords
- Post's Classes (1) (remove)
Institute
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.