Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy.

Hans L. Bodlaender Michael R. Fellows Michael T. Hallett

Published in: STOC (1994)

Keyphrases

np complete
real time
genetic algorithm
information systems
real world
information retrieval
artificial intelligence
image segmentation
evolutionary algorithm
np hard
worst case
optimization problems
learning theory
problems involving
computational problems