Complexity and Real Computation : Foreword by Richard M. Karp (1998. XVI, 453 p. w. 47 ill. and 3 col. plates. 24,5 cm)

Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. Upper bounds on the computational complexity of a problem are usually derived by constructing and analyzing specific algorithms.