Computational Complexity: A Modern Approach - Hardcover
$74.99
$78.99
-5%Quantity
01
Pay over time for orders over $35.00 with
Offers & Perks
Earn 74 points with this purchase
Added to your rewards balance after checkout.
100 points welcome bonus
Create an account and start with extra points.
Languages:EnglishPublisher:Cambridge University PressISBN-13:9780521424264ISBN-10:521424267UPC:9780521424264Book Category:Computers, MathematicsBook Subcategory:LogicSize:9.90 x 7.30 x 1.60 inchesWeight:2.7Product ID:SC3D8XBFWX
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.
Languages:EnglishPublisher:Cambridge University PressISBN-13:9780521424264ISBN-10:521424267UPC:9780521424264Book Category:Computers, MathematicsBook Subcategory:LogicSize:9.90 x 7.30 x 1.60 inchesWeight:2.7Product ID:SC3D8XBFWX
Arora, Sanjeev: - 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.Barak, Boaz: - 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.
Publisher: Cambridge University Press
Contributor(s)
Authors
Free shipping on orders over $75. Standard shipping takes 3-7 business days. Eligible items may be returned within 30 days of delivery. Conditions apply.