Introduction to Theory of Computation

Explore the fascinating world of computational theory with the "Introduction to Theory of Computation" by Mitsunori Ogihara, published by Springer International Publishing AG in 2025. This comprehensive hardback edition spans 382 pages and delves deeply into essential topics such as space complexity classes, PSPACE complete problems, and NL-complete problems, including the intriguing proof that NL equals coNL.

But the journey doesn't stop there! This insightful text goes beyond NP-completeness, introducing readers to Ladner's construction of non-NPC sets, as well as randomized complexity classes and critical concepts like BPP and the polynomial hierarchy. Ideal for students and professionals alike, this book is a must-have for anyone looking to deepen their understanding of theoretical computer science.