Synopsis
New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
"synopsis" may belong to another edition of this title.
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.
Other Popular Editions of the Same Title
Search results for Computational Complexity: A Modern Approach
Stock Image
Computational Complexity: A Modern Approach
Published by
Cambridge University Press, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
Used
Hardcover
Seller: HPB-Red, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
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
Stock Image
Computational Complexity: A Modern Approach
Published by
Cambridge University Press, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
Used
Hardcover
Seller: Evergreen Goodwill, Seattle, WA, U.S.A.
Seller rating 5 out of 5 stars
hardcover. Condition: Good. Seller Inventory # mon0000325644
Stock Image
Computational Complexity: A Modern Approach
Published by
Cambridge University Press, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
Used
Hardcover
Seller: Wonder Book, Frederick, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Like New condition. A near perfect copy that may have very minor cosmetic defects. Seller Inventory # V12B-04487
Stock Image
Computational Complexity: A Modern Approach
Published by
Cambridge University Press, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
New
Hardcover
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Feb2416190002409
Seller Image
Computational Complexity : A Modern Approach
Published by
Cambridge University Press, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
New
Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 6020661-n
Stock Image
Computational Complexity: A Modern Approach
Published by
Cambridge University Press, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
New
Hardcover
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9780521424264
Seller Image
Computational Complexity : A Modern Approach
Published by
Cambridge University Press, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
Used
Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 6020661
Stock Image
Computational Complexity: A Modern Approach
Published by
Cambridge University Press, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
New
Hardcover
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9780521424264_new
Buy New
£ 61.31
£ 11.98 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Computational Complexity (Hardcover)
Published by
Cambridge University Press, Cambridge, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
New
Hardcover
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. 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. The book starts with a broad introduction to the field and progresses to advanced results. Contents include: definition of Turing machines and basic time and space complexity classes, probabilistic algorithms, interactive proofs, cryptography, quantum computation, lower bounds for concrete computational models (decision trees, communication complexity, constant depth, algebraic and monotone circuits, proof complexity), average-case complexity and hardness amplification, derandomization and pseudorandom constructions, and the PCP theorem. 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 than 300 exercises are included. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521424264
Seller Image
Computational Complexity : A Modern Approach
Published by
Cambridge University Press, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
New
Hardcover
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 6020661-n
Buy New
£ 61.30
£ 15 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available