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

Visit Seller's Storefront

Seller's business information

McCord Books
IA, U.S.A.

Sale & Shipping Terms

Terms of Sale

Shipping Terms

Shipping rates within U.S.A.

Shipping rates within U.S.A.
Order quantity	5 to 14 business days	3 to 6 business days
First item	US$ 5.00	US$ 10.00

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.