Consistent Identification in the Limit of Any of the Classes k -Valued Is NP-hard.
Christophe Costa FlorêncioPublished in: LACL (2001)
Keyphrases
- np hard
- optimal solution
- lower bound
- decision problems
- np complete
- scheduling problem
- data sets
- computationally tractable
- class labels
- linear programming
- special case
- real time
- search space
- search engine
- learning algorithm
- genetic algorithm
- machine learning
- branch and bound algorithm
- knapsack problem
- approximation algorithms
- minimum cost
- consistency constraints
- np hardness
- person identification
- computationally challenging
- class hierarchy