Cook Reducibility is Faster than Karp Reduciblity in NP.

Luc Longpré Paul Young

Published in: J. Comput. Syst. Sci. (1990)

Keyphrases

computational complexity
np complete
memory efficient
data sets
databases
decision making
pattern recognition
preprocessing
data model
real time
face recognition
lower bound
pattern matching
knapsack problem