• Corpus ID: 215746906

Computational Complexity: A Modern Approach

@inproceedings{Arora2009ComputationalCA,
  title={Computational Complexity: A Modern Approach},
  author={Sanjeev Arora and Boaz Barak},
  year={2009},
  url={https://api.semanticscholar.org/CorpusID:215746906}
}
This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory and can be used as a reference for self-study for anyone interested in complexity.
No Paper Link Available
3,285 Citations
Highly Influential Citations
382
Background Citations
1,417
Methods Citations
463
Results Citations
23

Figures from this paper

3,285 Citations

A Short Introduction to Implicit Computational Complexity

These lecture notes are meant to serve as a short introduction to implicit computational complexity for those students who have little or no knowledge of recursion theory and proof theory. They have…

An Introduction to Computational Complexity

The contents of this chapter are related to algebra as they are ancillary concepts that help (and in some cases allow) the understanding of algebra.

Complexity Theory Basics: NP and NL

We introduce basic concepts and results in computational complexity as background for some of the articles in this volume. Our focus is on the complexity classes nondeterministic polynomial time (NP)…

Meta-Mathematics of Computational Complexity Theory

    Igor C. Oliveira
    Mathematics, Computer Science
    Electron. Colloquium Comput. Complex.
  • 2025
We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings…

Theoretical Computer Science: Computational Complexity

An elegant tool for proofs of lower bounds for time/space complexity is a totally different notion of complexity: Kolmogorov complexity which measures the information contents.

SIGACT News Complexity Theory Column 124 Meta-Mathematics of Computational Complexity Theory

We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings…

Fundamental Limits to Computing

    R. Bera
    Computer Science, Physics
  • 2020
This chapter introduces certain fundamental limits that mathematics, thermodynamics, information theory, and computational complexity impose on algorithm development and provides an understanding of the deep issues involved in the development of quantum algorithms and the hurdles that lie ahead.

Preliminaries from Theoretical Computer Science

This chapter is a brief introduction into basic concepts from complexity theory, and starts with several general notations from formal language theory (words, finite automata, word rewriting systems).

Computational Complexity Theory and the Philosophy of Mathematics†

This paper highlights the significance of complexity theory relative to questions traditionally asked by philosophers of mathematics while also attempting to isolate some new ones — e.g., about the notion of feasibility in mathematics, the $\mathbf{P} \neq \ mathbf{NP}$ problem and why it has proven hard to resolve, and the role of non-classical modes of computation and proof.

Kurt Gödel and the Foundations of Mathematics: The Gödel Phenomenon in Mathematics: A Modern View

What are the limits of mathematical knowledge? The purpose of this chapter is to introduce the main concepts from computational complexity theory that are relevant to algorithmic accessibility of…
...

549 References

Algebraic complexity theory

This is the first book to present an up-to-date and self-contained account of Algebraic Complexity Theory that is both comprehensive and unified. Requiring of the reader only some basic algebra and…

Introduction to Automata Theory, Languages and Computation

A computational introduction to number theory and algebra

    V. Shoup
    Mathematics, Computer Science
  • 2005
This edition now includes over 150 new exercises, ranging from the routine to the challenging, that flesh out the material presented in the body of the text, and which further develop the theory and present new applications.

Algebraic Complexity Theory

    V. Strassen
    Mathematics
    Handbook of Theoretical Computer Science, Volume…
  • 1990

Introduction to the Theory of Computation

Throughout the book, Sipser builds students' knowledge of conceptual tools used in computer science, the aesthetic sense they need to create elegant systems, and the ability to think through problems on their own.

The Computational Complexity Column

This is a survey about the title question, written for people who (like the author) see logic as forbidding, esoteric, and remote from their usual concerns. Beginning with a crash course on…

Computational complexity: a conceptual perspective

It is the view is that these (\non-technical") aspects are the core of the field, and the presentation attempts to re ect this view.

Descriptive Complexity

    N. Immerman
    Computer Science, Mathematics
    Graduate Texts in Computer Science
  • 1999
The core of the book is contained in Chapters 1 through 7, although even here some sections can be omitted according to the taste and interests of the instructor, and the remaining chapters are more independent of each other.

Computing over the Reals: Foundations for Scientific Computing

We give a detailed treatment of the ``bit-model'' of computability and complexity of real functions and subsets of R^n, and argue that this is a good way to formalize many problems of scientific…

P , NP and mathematics – a computational complexity perspective

The underlying concepts and problems, the attempts to understand and solve them, and some of the research directions this led us to, are described, as well as the major goals and conjectures which still elude us.
...