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: | Kosub, Sven |
---|---|
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 |
Similar Items
-
Operators of Higher Order
by: Baier, Herbert
Published: (1998) -
A note on topological concepts for complexity reduction of binary survey data
by: Buchta, Christian, et al.
Published: (2000) -
Worte am Werk : Wittgenstein über Sprache und Welt
by: Carrujo Covas, Luis Miguel
Published: (2008) -
Worte am Werk Wittgenstein über Sprache und Welt
Published: (2008) -
Uchanganuzi wa hiponimia za vitenzi vya Kiswahili
by: Odoyo Okal, Benard, et al.
Published: (2017)