In 1965 Juris Hartmanis and Richard E. Stearns published a paper "On the Computational Complexity of Algorithms". The field of complexity theory takes its name

This volume provides a survey of the subject in the form of a collection of articles written by experts, that together provides a comprehensive guide to researc

Modern cryptology increasingly employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research topics in complexity th

"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretic

This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of comp