Computational Complexity

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

Computational Complexity

Author: Sanjeev Arora

Publisher: Cambridge University Press

ISBN: 0521424267

Page: 579

View: 462

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

Related Books:

Computational Complexity
Language: en
Pages: 579
Authors: Sanjeev Arora, Boaz Barak
Categories: Computers
Type: BOOK - Published: 2009-04-20 - Publisher: Cambridge University Press

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
Computational Complexity
Language: en
Pages: 632
Authors: Oded Goldreich
Categories: Computers
Type: BOOK - Published: 2008-04-28 - Publisher: Cambridge University Press

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. Can be
Computational Complexity
Language: en
Pages: 523
Authors: Christos H. Papadimitriou
Categories: Computers
Type: BOOK - Published: 1994 - Publisher: Pearson

The first unified introduction and reference for the field of computational complexity. Virtually non-existent only 25 years ago, computational complexity has expanded tremendously and now comprises a major part of the researh activity in theoretical science.
Computational Complexity: A Quantitative Perspective
Language: en
Pages: 352
Authors: Marius Zimand
Categories: Computers
Type: BOOK - Published: 2004-07-07 - Publisher: Elsevier

There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we want an adversary to
Computational Complexity of Solving Equation Systems
Language: en
Pages: 64
Authors: Przemysław Broniek
Categories: Computers
Type: BOOK - Published: 2015-07-24 - Publisher: Springer

This volume considers the computational complexity of determining whether a system of equations over a fixed algebra A has a solution. It examines in detail the two problems this leads to: SysTermSat(A) and SysPolSat(A), in which equations are built out of terms or polynomials, respectively. The book characterizes those algebras