Faithin Omaha eBook Collection

Paying witness to the author’s thirty-year career in science, these high-quality papers, some co-written with colleagues, reflect his professional range, cove

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

An extensive and authoritative introduction to property testing, the study of super-fast algorithms for the structural analysis of large quantities of data in o

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

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