Jump to ratings and reviews
Rate this book

Complexity in Computer Science

Rate this book
Computational complexity theory is about the fundamental capabilities and limitations of efficient computation. Framing the subject in the broader context of computer science, this guidebook is both a self-contained tutorial for beginning graduate students in all areas of computer science and a thorough reference for specialists. Using only elementary discrete math, the book rigorously covers the central concepts of time, space, and randomness in computing, as well as connections to other areas of computer science such as cryptography and machine learning. Intuitions and general techniques are emphasized. The book features full proofs, numerous concrete examples and illustrations, and hundreds of exercises.

750 pages, Hardcover

Published November 19, 2026

Loading...
Loading...

About the author

Thomas Watson is Associate Professor of Computer Science at the University of Memphis. He received his Ph.D. from the University of California, Berkeley. His research spans many areas of computational complexity and has been supported by an NSF CAREER award.

Ratings & Reviews

What do you think?
Rate this book

Friends & Following

Create a free account to discover what your friends think of this book!

Community Reviews

5 stars
0 (0%)
4 stars
0 (0%)
3 stars
0 (0%)
2 stars
0 (0%)
1 star
0 (0%)
No one has reviewed this book yet.