The Computational Complexity of Choice Sets.
Felix BrandtFelix A. FischerPaul HarrensteinPublished in: Math. Log. Q. (2009)
Keyphrases
- computational complexity
- np complete
- special case
- computational cost
- explanatory power
- set theoretic
- information retrieval
- memory requirements
- low complexity
- computationally efficient
- database systems
- objective function
- hidden markov models
- np hard
- multiresolution
- worst case
- real time
- bayesian networks
- computer vision
- artificial intelligence
- learning algorithm
- genetic algorithm
- data mining
- data sets