Logo

Computational Complexity: A Conceptual Perspective

Large book cover: Computational Complexity: A Conceptual Perspective

Computational Complexity: A Conceptual Perspective
by

Publisher: Cambridge University Press
ISBN/ASIN: 052188473X
ISBN-13: 9780521884730
Number of pages: 632

Description:
This book offers a comprehensive perspective to modern topics in complexity theory, which is a central field of the theoretical foundations of computer science. It addresses the looming question of what can be achieved within a limited amount of time with or without other limited natural computational resources. The book can be used as an introduction for advanced undergraduate and graduate students as either a textbook or for self-study, or to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems.

Home page url

Download or read it online for free here:
Download link
(1.4MB, PS)

Similar books

Book cover: Foundations of CryptographyFoundations of Cryptography
by - Cambridge University Press
The book gives the mathematical underpinnings for cryptography; this includes one-way functions, pseudorandom generators, and zero-knowledge proofs. Throughout, definitions are complete and detailed; proofs are rigorous and given in full.
(14464 views)
Book cover: Parallel Complexity TheoryParallel Complexity Theory
by - Prentice Hall
The rapid growth of parallel complexity theory has led to a proliferation of parallel machine models. This book presents a unified theory of parallel computation based on a network model. It is the first such synthesis in book form.
(7561 views)
Book cover: From Complexity to CreativityFrom Complexity to Creativity
by - Plenum Press
This text applies the concepts of complexity science to provide an explanation of all aspects of human creativity. The book describes the model that integrates ideas from computer science, mathematics, neurobiology, philosophy, and psychology.
(13326 views)
Book cover: Communication Complexity (for Algorithm Designers)Communication Complexity (for Algorithm Designers)
by - Stanford University
The two biggest goals of the course are: 1. Learn several canonical problems that have proved the most useful for proving lower bounds; 2. Learn how to reduce lower bounds for fundamental algorithmic problems to communication complexity lower bounds.
(3974 views)