
502 Design and Analysis of Algorithms
23. NP-Complete problems are the most dif-
fi cult problems in NP (“non-deterministic
polynomial time’’) in the sense that they are
the ones most likely not to be in P. The reason
is that if you could fi nd a way to solve any
NP-complete problem quickly (in polynomial
time), then you could use that algorithm to
solve all NP problems quickly.
24. Reductions showing the feasibility and
giving actual construct to map (convert) a
problem class A to another problem class B,
so that if one can solve B, then solution of A
is possible.
25. Space complexity the growth of memory
requirements of an algorithm with ...