Faithin Omaha eBook Collection

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.

A complete treatment of fundamentals and recent advances in complexity theory Complexity theory studies the inherent difficulties of solving algorithmic problem

The classical theory of computation has its origins in the work of Goedel, Turing, Church, and Kleene and has been an extraordinarily successful framework for t

This book offers a comprehensive perspective to modern topics in complexity theory, which is a central field of the theoretical foundations of computer science.

This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into historical conte