On the Relative Complexity of Subproblems of Intractable Problems.

Klaus Ambos-Spies

Published in: STACS (1985)

Keyphrases

np complete
artificial neural networks
decision problems
optimization problems
problems involving
case study
computational complexity
complexity bounds
neural network
image sequences
search space
application domains
computational problems
np hardness
polynomial hierarchy
polynomial time complexity