Computational Complexity: A Modern Approach / Sanjeev Arora and Boaz Barak
Type Book
Created 2009-04-20
Available at theory.cs.princeton.edu/complexity
Identifier 978-0521424264
Description
This is a textbook on computational complexity theory. It is intended as a text for an advanced undergraduate course or introductory graduate course, or as a reference for researchers and students in computer science and allied fields such as mathematics and physics.
Relations
In theoretical computer science and mathematics, the theory of computation is the branch that deals w...
precedes Introduction to Complexity and Computability
This is a basic course on the theory of algorithms, computability and computational complexity. Rough...
Edit details Edit relations Attach new author Attach new topic Attach new resource
0.0 /10
useless alright awesome
from 0 reviews
- Resource level 0.0 /10
- beginner intermediate advanced
- Resource clarity 0.0 /10
- hardly clear sometimes unclear perfectly clear
- Reviewer's background 0.0 /10
- none basics intermediate advanced expert