Complexity and Partitions
Computational complexity theory usually investigates the complexity of sets, i.e., the complexity of partitions into two parts. But often it is more appropriate to represent natural problems by partitions into more than two parts. A particularly interesting class of such problems consists of classif...
Main Author: | |
---|---|
Format: | Doctoral Thesis |
Language: | English |
Published: |
2001
|
Subjects: | |
Online Access: | https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/234 http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-2808 https://nbn-resolving.org/urn:nbn:de:bvb:20-opus-2808 https://opus.bibliothek.uni-wuerzburg.de/files/234/diss-kosub.pdf |