This book provides an extensive outlook on contemporary subjects in complexity theory, a pivotal domain within the theoretical underpinnings of computer science. It explores the fundamental question of what can be accomplished within specific time constraints and with other restricted natural computational resources. Suitable for use as an introductory resource for advanced undergraduate and graduate students, serving either as a textbook or for self-directed study, it also caters to experts by offering detailed explanations of various complexity theory sub-areas, including hardness amplification, pseudorandomness, and probabilistic proof systems.
Download
See also
- Software Exorcism: A Handbook for Debugging and Optimizing Legacy Code by Bill Blunden (2003)
- Hormones and the Endocrine System: Textbook of Endocrinology by Bernhard Kleine (2016)
- Genetics: A Conceptual Approach 6e by Benjamin A. Pierce (2017)
- A Functional Approach to Java by Ben Weidig (2022)
- Calculus of variations and optimal control by Amol Sasan (2005)