This volume presents four machine-independent theories of computational complexity, which have been chosen for their intrinsic importance and practical relevance. The book includes a wealth of results - classical, recent, and others which have not been published before.In developing the mathematics underlying the size, dynamic and structural complexity measures, various connections with mathematical logic, constructive topology, probability and programming theories are established. The facts are presented in detail. Extensive examples are provided, to help clarify notions and constructions. The lists of exercises and problems include routine exercises, interesting results, as well as some open problems.

The book will synthesize and integrate better what are often disparate ideas, themes, and methods across substantive areas of white-collar crime and criminology and criminal justice. The book also puts together critical and emerging topics within criminology and criminal justice that have important implications for the study of white-collar crime and criminology/criminal justice more generally.

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