Complexity Classes with Complete Problems Between P and NP-C.
Carme ÀlvarezJosep DíazJacobo ToránPublished in: FCT (1989)
Keyphrases
- tractable cases
- decision problems
- np complete
- computational complexity
- np hard
- decision trees
- problems involving
- combinatorial optimization
- application domains
- multi objective
- data mining
- multi agent
- artificial intelligence
- reinforcement learning
- benchmark problems
- computer vision
- solving problems
- multi class problems
- computational issues
- genetic algorithm