From
Textbooks_Source, Columbia, MO, U.S.A.
Seller rating 5 out of 5 stars
AbeBooks Seller since November 10, 2017
Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes). Seller Inventory # 000948422U
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.
Title: Computational Complexity: A Modern Approach
Publisher: Cambridge University Press
Publication Date: 2009
Binding: Hardcover
Condition: Good
Edition: 1st Edition.
Seller: Evergreen Goodwill, Seattle, WA, U.S.A.
hardcover. Condition: Good. Seller Inventory # mon0000325644
Seller: HPB-Red, Dallas, TX, U.S.A.
Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_450733825
Seller: Marlton Books, Bridgeton, NJ, U.S.A.
Condition: Acceptable. Readable, but has significant damage / tears. Has a remainder mark. hardcover Used - Acceptable 2009. Seller Inventory # AB-002713
Seller: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Hardcover. Condition: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less. Seller Inventory # G0521424267I5N00
Seller: Wonder Book, Frederick, MD, U.S.A.
Condition: As New. Like New condition. A near perfect copy that may have very minor cosmetic defects. Seller Inventory # V12B-04487
Seller: moluna, Greven, Germany
Condition: New. Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More tha. Seller Inventory # 5918908
Quantity: 1 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Feb2416190002409
Seller: preigu, Osnabrück, Germany
Buch. Condition: Neu. Computational Complexity | A Modern Approach | Sanjeev Arora (u. a.) | Buch | Gebunden | Englisch | 2009 | Cambridge University Pr. | EAN 9780521424264 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu. Seller Inventory # 101652002
Quantity: 1 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # DB-9780521424264
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 6020661-n