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 300 exercises are included with a selected hint set.

About the Authors:

Sanjeev Arora is a Professor in the department of computer science at Princeton University. He holds a Ph.D. from the University of California, Berkeley and has done foundational work in complexity theory, probabilistically checkable proofs, and approximation algorithms.

Boaz Barak is an assistant professor in the department of computer science at Princeton University. He holds a Ph.D. from the Weizmann Institute of Science.

"About this title" may belong to another edition of this title.

Store Description

The Saint Bookstore has a range of over 1 million titles available.

Visit Seller's Storefront

Seller's business information

SB ONLINE LTD
50 Devonshire Road, Southport, PR9 7BZ, United Kingdom

Terms of Sale:

Please order through the Abebooks checkout. We only take orders through Abebooks - We don't take direct orders by email or phone.

Refunds or Returns: A full refund of the purchase price will be given if returned within 30 days in undamaged condition.

As a seller on abebooks we adhere to the terms explained at http://www.abebooks.co.uk/docs/HelpCentral/buyerIndex.shtml - if you require further assistance please email us at orders@thesaintbookstore.co.uk

Shipping Terms:

Most orders usually ship within 1-3 business days, but some can take up to 7 days.

Payment Methods
accepted by seller

Add to Wants

Items related to Computational Complexity: A Modern Approach

Computational Complexity: A Modern Approach

Sanjeev Arora

New - Hardcover

Seller's business information