Structural Properties of NP-Hard Sets and Uniform Characterisations of Complexity Classes
This thesis is devoted to the study of computational complexity theory, a branch of theoretical computer science. Computational complexity theory investigates the inherent difficulty in designing efficient algorithms for computational problems. By doing so, it analyses the scalability of computation...
| Main Author: | |
|---|---|
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
2007
|
| Subjects: | |
| Online Access: | https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/2319 http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-27124 https://nbn-resolving.org/urn:nbn:de:bvb:20-opus-27124 https://opus.bibliothek.uni-wuerzburg.de/files/2319/traversdiss.pdf |