The Nature of Computation

Note moyenne 4,5
( 48 avis fournis par Goodreads )
 
9780199233212: The Nature of Computation

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, cryptography, and quantum computing are usually considered too "advanced" to show to the typical student. The aim of this book is to bridge both gaps by explaining the deep ideas of theoretical computer science in a clear and enjoyable fashion, making them accessible to non computer scientists and to computer scientists who finally want to understand what their formalisms are actually telling.

This book gives a lucid and playful explanation of the field, starting with P and NP-completeness. The authors explain why the P vs. NP problem is so fundamental, and why it is 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 graduates and undergraduates, scientists from other areas who have long wanted to understand this subject, and experts who want to fall in love with this field all over again.

To request a copy of the Solutions Manual, visit: http://global.oup.com/uk/academic/physics/admin/solutions

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

About the Author :


Cristopher Moore graduated from Northwestern University with honors in 1986, at the age of 18, with a B.A. in Mathematics, Physics, and Integrated Science. He received his Ph.D. in Physics from Cornell University at the age of 23. After a postdoc at the Santa Fe Institute, he joined the faculty of the University of New Mexico, where he holds joint appointments in Computer Science and Physics and Astronomy. He has written over 90 papers, on topics ranging from undecidability in dynamical systems, to quantum computing, to phase transitions in NP-complete problems, to the analysis of social and biological networks.

Stephan Mertens got his Diploma in Physics in 1989, and his Ph.D. in Physics in 1991, both from Georg-August University Göttingen. He holds scholarships from the "Studienstiftung des Deutschen Volkes", Germany's most prestigious organisation sponsoring the academically gifted. After his Ph.D. he worked for three years in the software industry before he joined the faculty of Otto-von-Guericke University Magdeburg as a theoretical physicist. His research focuses on disordered systems in statistical mechanics, average case complexity of algorithms, and parallel computing.

Review :


"To put it bluntly: this book rocks! It's 900+ pages of awesome. It somehow manages to combine the fun of a popular book with the intellectual heft of a textbook, so much so that I don't know what to call it (but whatever the genre is, there needs to be more of it!)." -- Scott Aaronson, Massachusetts Institute of Technology


"A creative, insightful, and accessible introduction to the theory of computing, written with a keen eye toward the frontiers of the field and a vivid enthusiasm for the subject matter." -- Jon Kleinberg, Cornell University


"If you want to learn about complexity classes, scaling laws in computation, undecidability, randomized algorithms, how to prepare a dinner with Pommard, Quail and Roquefort, or the new ideas that quantum theory brings to computation, this is the right book. It offers a wonderful tour through many facets of computer science. It is precise and gets into details when necessary, but the main thread is always at hand, and entertaining anecdotes help to keep the pace." -- Marc Mézard, Université de Paris Sud, Orsay


"A treasure trove of ideas, concepts and information on algorithms and complexity theory. Serious material presented in the most delightful manner!" -- Vijay Vazirani, Georgia Instituute of Technology


"A fantastic and unique book - a must-have guide to the theory of computation, for physicists and everyone else." -- Riccardo Zecchina, Politecnico di Torino


"The Nature of Computation (TNoC) is a comprehensive, accessible, and highly enjoyable book that conveys the key intellectual contributions of the theory of computing. The project took off as an effort to present theoretical computer science to physicists, but it is equally suitable for any science graduate who is curious to explore beautiful and deep ideas related to the mathematical structure of problems. ... TNoC provides not just a window through which people from other disciplines can get glimpses of the interesting nuggets from computer science, but also provides an entertaining open house session where a visitor can meet various deep ideas and understand the core arguments behind key results." --Haris Aziz, SIGACT News Book Review Column


"The book is highly recommended for all interested readers: in or out of courses, students undergraduate, researchers in other fields eager to learn the subject, or scholars already in the field who wish to enrich their current understanding. It makes for a great textbook in a conventional theory of computing course, as I can testify from recent personal experience (I used it once; I'll use it again!). With its broad and deep wealth of information, it would be a top contender for one of my "desert island" books. [The Nature of Computation] speaks directly, clearly, convincingly, and entertainingly, but also goes much further: it inspires." --Frederic Green, SIGACT News Book Review Column


Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Acheter neuf Afficher le livre
EUR 62,76

Autre devise

Frais de port : EUR 3,34
De Royaume-Uni vers Etats-Unis

Destinations, frais et délais

Ajouter au panier

Meilleurs résultats de recherche sur AbeBooks

1.

Cristopher Moore, Stephan Mertens
Edité par OUP Oxford 2011-08-11, Oxford (2011)
ISBN 10 : 0199233217 ISBN 13 : 9780199233212
Neuf(s) Couverture rigide Quantité : > 20
Vendeur
Blackwell's
(Oxford, OX, Royaume-Uni)
Evaluation vendeur
[?]

Description du livre OUP Oxford 2011-08-11, Oxford, 2011. hardback. État : New. N° de réf. du libraire 9780199233212

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 62,76
Autre devise

Ajouter au panier

Frais de port : EUR 3,34
De Royaume-Uni vers Etats-Unis
Destinations, frais et délais

2.

Mertens, Stephan
Edité par OUP Oxford (2011)
ISBN 10 : 0199233217 ISBN 13 : 9780199233212
Neuf(s) Quantité : > 20
Vendeur
Books2Anywhere
(Fairford, GLOS, Royaume-Uni)
Evaluation vendeur
[?]

Description du livre OUP Oxford, 2011. HRD. État : New. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. N° de réf. du libraire FU-9780199233212

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 56,52
Autre devise

Ajouter au panier

Frais de port : EUR 10,03
De Royaume-Uni vers Etats-Unis
Destinations, frais et délais

3.

Cristopher Moore
ISBN 10 : 0199233217 ISBN 13 : 9780199233212
Neuf(s) Quantité : 14
Vendeur
Book Park
(Southfield, MI, Etats-Unis)
Evaluation vendeur
[?]

Description du livre État : New. Brand New Book. N° de réf. du libraire 0199233217BYR

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 68,08
Autre devise

Ajouter au panier

Frais de port : Gratuit
Vers Etats-Unis
Destinations, frais et délais

4.

Cristopher Moore; Stephan Mertens
ISBN 10 : 0199233217 ISBN 13 : 9780199233212
Neuf(s) Quantité : > 20
Vendeur
BWB
(Valley Stream, NY, Etats-Unis)
Evaluation vendeur
[?]

Description du livre État : New. Depending on your location, this item may ship from the US or UK. N° de réf. du libraire 97801992332120000000

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 69,02
Autre devise

Ajouter au panier

Frais de port : Gratuit
Vers Etats-Unis
Destinations, frais et délais

5.

Cristopher Moore,Stephan Mertens
Edité par OUP Oxford 2011-06 (2011)
ISBN 10 : 0199233217 ISBN 13 : 9780199233212
Neuf(s) Quantité : 5
Vendeur
Chiron Media
(Wallingford, Royaume-Uni)
Evaluation vendeur
[?]

Description du livre OUP Oxford 2011-06, 2011. État : New. Brand new book, sourced directly from publisher. Dispatch time is 24-48 hours from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. N° de réf. du libraire NU-GRD-04746646

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 66,38
Autre devise

Ajouter au panier

Frais de port : EUR 3,33
De Royaume-Uni vers Etats-Unis
Destinations, frais et délais

6.

Cristopher Moore; Stephan Mertens
Edité par Oxford University Press
ISBN 10 : 0199233217 ISBN 13 : 9780199233212
Neuf(s) Quantité : > 20
Vendeur
INDOO
(Avenel, NJ, Etats-Unis)
Evaluation vendeur
[?]

Description du livre Oxford University Press. État : New. Brand New. N° de réf. du libraire 0199233217

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 69,97
Autre devise

Ajouter au panier

Frais de port : EUR 3
Vers Etats-Unis
Destinations, frais et délais

7.

Stephan Mertens, Cristopher Moore
Edité par Oxford University Press, United Kingdom (2011)
ISBN 10 : 0199233217 ISBN 13 : 9780199233212
Neuf(s) Couverture rigide Quantité : 10
Vendeur
The Book Depository
(London, Royaume-Uni)
Evaluation vendeur
[?]

Description du livre Oxford University Press, United Kingdom, 2011. Hardback. État : New. Language: English . Brand New Book. 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 theoretical computer 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 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.The book 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 over again. N° de réf. du libraire AOP9780199233212

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 73,53
Autre devise

Ajouter au panier

Frais de port : Gratuit
De Royaume-Uni vers Etats-Unis
Destinations, frais et délais

8.

Stephan Mertens, Cristopher Moore
Edité par Oxford University Press, United Kingdom (2011)
ISBN 10 : 0199233217 ISBN 13 : 9780199233212
Neuf(s) Couverture rigide Quantité : 10
Vendeur
The Book Depository US
(London, Royaume-Uni)
Evaluation vendeur
[?]

Description du livre Oxford University Press, United Kingdom, 2011. Hardback. État : New. Language: English . Brand New Book. 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 theoretical computer 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 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.The book 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 over again. N° de réf. du libraire AOP9780199233212

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 73,96
Autre devise

Ajouter au panier

Frais de port : Gratuit
De Royaume-Uni vers Etats-Unis
Destinations, frais et délais

9.

Cristopher Moore; Stephan Mertens
ISBN 10 : 0199233217 ISBN 13 : 9780199233212
Neuf(s) Quantité : 2
Vendeur
Speedy Hen
(London, Royaume-Uni)
Evaluation vendeur
[?]

Description du livre État : New. Bookseller Inventory # ST0199233217. N° de réf. du libraire ST0199233217

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 55,52
Autre devise

Ajouter au panier

Frais de port : EUR 21,19
De Royaume-Uni vers Etats-Unis
Destinations, frais et délais

10.

Cristopher Moore, Stephan Mertens
Edité par Oxford University Press, USA (2011)
ISBN 10 : 0199233217 ISBN 13 : 9780199233212
Neuf(s) Couverture rigide Quantité : 1
Vendeur
Ergodebooks
(RICHMOND, TX, Etats-Unis)
Evaluation vendeur
[?]

Description du livre Oxford University Press, USA, 2011. Hardcover. État : New. N° de réf. du libraire DADAX0199233217

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 76,08
Autre devise

Ajouter au panier

Frais de port : EUR 3,42
Vers Etats-Unis
Destinations, frais et délais

autres exemplaires de ce livre sont disponibles

Afficher tous les résultats pour ce livre