Computational Complexity: A Modern Approach

Arora, Sanjeev; Barak, Boaz

ISBN 10: 0521424267 / ISBN 13: 9780521424264

Published by Cambridge University Press, 2009

About this Item

This item is in overall acceptable condition. Covers and dust jackets are intact but may have heavy wear including creases, bends, edge wear, curled corners or minor tears as well as stickers or sticker-residue. Pages are intact but may have minor curls, bends or moderate to considerable highlighting/ writing. Binding is intact; however, spine may have heavy wear. Digital codes may not be included and have not been tested to be redeemable and/or active. A well-read copy overall. Please note that all items are donated goods and are in used condition. Orders shipped Monday through Friday! Your purchase helps put people to work and learn life skills to reach their full potential. Orders shipped Monday through Friday. Your purchase helps put people to work and learn life skills to reach their full potential. Thank you!

Seller Inventory # 466SUS003MKE

Bibliographic Details

• Title: Computational Complexity: A Modern Approach
• Publisher: Cambridge University Press
• Publication Date: 2009
• Language: English
• ISBN 10: 0521424267
• ISBN 13: 9780521424264
• Binding: Hardcover
• Condition: Acceptable

About this title

Synopsis

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.