Computational Complexity: A Modern Approach. Sanjeev Arora and Boaz Barak. Princeton University Authors: Sanjeev Arora, Princeton University, New Jersey; Boaz Barak, both recent achievements and classical results of computational complexity theory. Computational Complexity: A. Modern Approach. Draft of a book: Dated August Comments welcome! Sanjeev Arora and Boaz Barak. Princeton University.
|Published (Last):||13 May 2005|
|PDF File Size:||12.80 Mb|
|ePub File Size:||7.96 Mb|
|Price:||Free* [*Free Regsitration Required]|
This is a very comprehensive and detailed book on computational complexity. Its target audience are the advanced undergraduates or the first-year graduate students in computational science or a related field.
The book has many good and interesting exercises and is very suitable as a textbook. It can be used as a self-study textbook for researchers in other approwch as well. However, the notation may not be too familiar to those who have not had any prior exposure to complexiy topics in computational complexity. I am a theoretical Physicist and I consider myself to be fairly well versed in advanced mathematics, but I would probably want to read a book that is at a level just below this one in order to familiarize myself with the notational conventions.
Otherwise, it is an extremely interesting and well-organized textbook.
Sanjeev Arora is a Professor in the department of computer science at Princeton University. He holds a Ph.
Boaz Barak is an assistant professor in the department of computer science at Princeton University. Account Options Sign in. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, My library Help Advanced Book Search.
Computational Complexity: A Modern Approach / Sanjeev Arora and Boaz Barak
Cambridge University Press Amazon. Sanjeev AroraBoaz Barak. Cambridge University PressApr 20, – Computers.
This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars.
More than exercises are included with a selected hint set. The book starts with a broad introduction to the field and progresses to advanced results.
User Review – Flag as inappropriate This is a very comprehensive and detailed book on computational complexity. Selected pages Page Other editions – View all Computational Complexity: Computational complexity Sanjeev Approafh Snippet view –