ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: Oxford University Press] Hardcover In
[Uxbridge, United Kingdom] [Publication Year: 2011]

Oxford, England Oxford University Press, USA 2011 Hard cover New. Glued binding. Paper over boards. 1004 p. Contains: Figures.

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: Oxford Univ Pr] Hardcover 1st edition. 985 pages. 9.69x7.44x0.12 inches. In Stock.
[Exeter, United Kingdom] [Publication Year: 2010]

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: OUP Oxford] Hardcover Book is in NEW condition. Satisfaction Guaranteed! Fast Customer Service!!
[Suffolk, United Kingdom] [Publication Year: 2011]

Oxford, England Oxford University Press, USA 2011 Hard cover New. Glued binding. Paper over boards. 1004 p. Contains: Figures.

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: OUP Oxford] Hardcover New Book. Shipped from UK. Established seller since 2000.
[Fairford, GLOS, United Kingdom] [Publication Year: 2011]

OUP Oxford 8/11/2011 12: 00: 00 AM Hardcover PLEASE NOTE, WE DO NOT SHIP TO DENMARK. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Please note we cannot offer an expedited shipping service from the UK.

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: KNV Besorgung] Hardcover Why are some problems easy to solve, while others seem nearly impossible? What can we compute with a given amount of time or memory, and what cannot be computed at all? How will quantum physics change the landscape of computation? This book gives a playful.
[Greven, Germany] [Publication Year: 2011]
Show/Hide image

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: Oxford University Press] Hardcover
[Humble, TX, U.S.A.] [Publication Year: 2011]

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: Oxford University Press] Hardcover First Edition 2011. 1st Edition. Hardcover. Why are some problems easy to solve, while others seem nearly impossible? What can we compute with a given amount of time or memory, and what cannot be computed at all? How will quantum physics change the landscape of computation? This book gives a playful and accessible introduction to the deep ideas of theoretical computer science. Num Pages: 1004 pages, 338 b/w line illustrations, and 30 b/w halftones. BIC Classification: PBCD; PH; UGK. Category: (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 249 x 195 x 55. Weight in Grams: 2316. . . . . .
[Galway, GY, Ireland] [Publication Year: 2011]

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: Oxford University Press] Hardcover
[DH, SE, Spain] [Publication Year: 2011]

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: OXFORD UNIVERSITY PRESS] Hardcover
[Moncks Corner, SC, U.S.A.] [Publication Year: 2011]

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: Oxford University Press] Hardcover
[Castle Donington, DERBY, United Kingdom] [Publication Year: 2011]
Show/Hide image

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: Oxford University Press, Oxford] Hardcover Hardcover. Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to biology. But this beauty is often buried underneath layers of unnecessary formalism, and exciting recent results like interactive proofs, phase transitions, and quantum computing are usually considered too advanced for the typical student. This book bridges these gaps by explaining the deep ideas of theoreticalcomputer science in a clear and enjoyable fashion, making them accessible to non-computer scientists and to computer scientists who finally want to appreciate their field from a new point of view. Theauthors start with a lucid and playful explanation of the P vs. NP problem, explaining why it is so fundamental, and so hard to resolve. They then lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing. At every turn, they use a minimum of formalism, providing explanations that are both deep and accessible. Thebook is intended for graduate and undergraduate students, scientists from other areas who have long wanted to understand this subject, and experts who want to fall in love with this field all overagain. Why are ...
Show/Hide image

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: Oxford University Press] Hardcover Buy for Great customer experience
[Houston, TX, U.S.A.] [Publication Year: 2011]

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: Oxford University Press] Hardcover Book is in NEW condition.
[Hawthorne, CA, U.S.A.] [Publication Year: 2011]

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: Oxford University Press] Hardcover
[Denver, CO, U.S.A.] [Publication Year: 2011]

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: Oxford University Press] Hardcover
[Miami, FL, U.S.A.] [Publication Year: 2011]

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: Oxford University Press] Hardcover
[Milano, MI, Italy] [Publication Year: 2011]

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: Oxford University Press (edition 1)] Hardcover Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported
[Philadelphia, PA, U.S.A.] [Publication Year: 2011]

Oxford, England Oxford University Press, USA 2011 Hard cover New. Glued binding. Paper over boards. 1004 p. Contains: Figures.

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: Oxford University Press] Hardcover New! This book is in the same immaculate condition as when it was published
[Tucson, AZ, U.S.A.] [Publication Year: 2011]

Oxford, England Oxford University Press, USA 2011 Hard cover New. Glued binding. Paper over boards. 1004 p. Contains: Figures.

ISBN10: 0199233217, ISBN13: 9780199233212, [publisher: Oxford University Press Aug 2011] Hardcover Neuware - Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to biology. But this beauty is often buried underneath layers of unnecessary formalism, and exciting recent results like interactive proofs, phase transitions, and quantum computing are usually considered too advanced for the typical student. This book bridges these gaps by explaining the deep ideas of theoreticalcomputer science in a clear and enjoyable fashion, making them accessible to non-computer scientists and to computer scientists who finally want to appreciate their field from a new point of view. The authors start with a lucid and playful explanation of the P vs. NP problem, explaining why it is sofundamental, and so hard to resolve. They then lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing. At every turn, they use a minimum of formalism, providing explanations that are both deep and accessible. The book is intended for graduate and undergraduate students, scientists from other areas who have longwanted to understand this subject, and experts who want to fall in love with this field all over again. ...
Show/Hide image