Bild 1 von 1
The Nature of Computation, Moore, Mertens 9780199233212 schneller kostenloser Versand...-
Artikelzustand:
Versand:
Standort: NY, USA
Lieferung:
Lieferung zwischen Fr, 7. Jun und Di, 11. Jun nach 43230 bei heutigem Zahlungseingang
Rücknahmen:
Zahlungen:
Sicher einkaufen
Angaben zum Verkäufer
- 98% positive Bewertungen
Angemeldet als gewerblicher Verkäufer
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:333649273789
Artikelmerkmale
- Artikelzustand
- PublishedOn
- 2011-06-01
- Title
- The Nature of Computation
- ISBN
- 9780199233212
- EAN
- 9780199233212
- Publication Year
- 2011
- Type
- Textbook
- Format
- Hardcover
- Language
- English
- Publication Name
- Nature of Computation
- Item Height
- 2.5in
- Item Length
- 9.7in
- Publisher
- Oxford University Press, Incorporated
- Item Width
- 7.4in
- Item Weight
- 81.1 Oz
- Number of Pages
- 1008 Pages, 1004 Pages
Über dieses Produkt
Product Information
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.
Product Identifiers
Publisher
Oxford University Press, Incorporated
ISBN-10
0199233217
ISBN-13
9780199233212
eBay Product ID (ePID)
63874109
Product Key Features
Publication Name
Nature of Computation
Format
Hardcover
Language
English
Publication Year
2011
Type
Textbook
Number of Pages
1008 Pages, 1004 Pages
Dimensions
Item Length
9.7in
Item Height
2.5in
Item Width
7.4in
Item Weight
81.1 Oz
Additional Product Features
Lc Classification Number
Qa267.7
Reviews
In a class by itself - in The Nature of Computation, Cristopher Moore and Stephan Mertens have produced one of the most successful attempts to capture the broad scope and intellectual depth of theoretical computer science as it is practiced today. The Nature of Computation is one of those books you can open to a random page and find something amazing, surprising and, often, very funny., "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 Mzard, 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, "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, "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, "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, "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, "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 throughmany 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 Mezard, Universite de Paris Sud, Orsay, "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, '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 thepace.'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, Moore and Mertens guide the reader through the interesting field of computational complexity in a clear, broadly accessible and informal manner, while systematically explaining the main concepts and approaches in this area and the existing links to other disciplines. The book is comprehensive and can be easily used as a textbook, at both advanced undergraduate and postgraduate levels, but is equally useful for researchers in neighbouring disciplines, such as statistical physics[...]. Some of the material covered, such as approximability issues and Probabilistically Checkable Proofs is typically not presented in books of this type, and the authors do an excellent job in presenting them very clearly and convincingly., 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!)., "A fantastic and unique book - a must-have guide to the theory of computation, for physicists and everyone else." --Riccardo Zecchina, Politecnico di Torino, 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., "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, A treasure trove of ideas, concepts and information on algorithms and complexity theory. Serious material presented in the most delightful manner!
Table of Content
1. Prologue2. The Basics3. Insights and Algorithms4. Needles in a Haystack: The class NP5. Who is the Hardest One of All: NP-Completeness6. The Deep Question: P vs. NP7. Memory, Paths and games8. Grand Unified Theory of Computation9. Simply the Best: Optimization10. The Power of Randomness11. Random Walks and Rapid Mixing12. Counting, Sampling, and Statistical Physics13. When Formulas Freeze: Phase Transitions in Computation14. Quantum Computing15. Epilogue16. Appendix: Mathematical Tools
Copyright Date
2008
Topic
Computer Science, General, Data Processing, Physics / General
Lccn
2011-288098
Intended Audience
Scholarly & Professional
Illustrated
Yes
Genre
Computers, Science
Artikelbeschreibung des Verkäufers
Rechtliche Informationen des Verkäufers
WRAP Ltd
Mubin Ahmed
2 Lester Way
Wallingford
OX10 9TA
United Kingdom
USt-IdNr.:
- GB 724498118
Handelsregisternummer:
- 03800600
Ich versichere, dass alle meine Verkaufsaktivitäten in Übereinstimmung mit allen geltenden Gesetzen und Vorschriften der EU erfolgen.
CRN Number:
- 03800600
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:333649273789
Verpackung und Versand
Artikelstandort:
NY, USA
Versand nach:
Weltweit
Ausgeschlossen:
Barbados, Französisch-Guayana, Französisch-Polynesien, Guadeloupe, Irland, Libyen, Martinique, Neukaledonien, Russische Föderation, Réunion, Ukraine, Venezuela, Vereinigtes Königreich
| Verpackung und Versand | Nach | Service | Lieferung*Siehe Lieferhinweise |
|---|---|---|---|
| Kostenloser Versand | USA | Sparversand (USPS Media MailTM) | Lieferung zwischen Fr, 7. Jun und Di, 11. Jun nach 43230 |
| Bearbeitungszeit |
|---|
| Der Verkäufer verschickt den Artikel innerhalb von 4 Werktagen nach Zahlungseingang. |
| Steuern |
|---|
| An der Kasse fallen ggf. Steuern an. Mehr erfahrenMehr erfahren zu Steuern auf eBay-Käufe. |
Mehrwertsteuer für diesen Artikel #333649273789
Mehrwertsteuer für diesen Artikel #333649273789
Der Verkäufer berechnet Mehrwertsteuer für Artikel, die in die folgenden Bundesstaaten verschickt werden:
| Bundesstaat | Steuersatz für Sales Tax |
|---|
Rücknahmebedingungen
| Frist | Rückerstattung erfolgt in folgender Form: | Rücksendung |
|---|---|---|
| 30 Tage | Geld zurück | Käufer zahlt Rückversand |
Der Käufer trägt die Rücksendekosten.
| Rücknahmebedingungen im Detail |
|---|
| Rücknahme akzeptiert |
Zahlungsdaten
Zahlungsmethoden
Hinweis: Bestimmte Zahlungsmethoden werden in der Kaufabwicklung nur bei hinreichender Bonität des Käufers angeboten.
Beliebte Kategorien in diesem Shop
Angemeldet als gewerblicher Verkäufer
Verkäuferbewertungen (513.664)
0***f (22)- Bewertung vom Käufer.
Letzter Monat
Bestätigter Kauf
A+++ great sell. amazing price 
r***e (370)- Bewertung vom Käufer.
Letzter Monat
Bestätigter Kauf
Thanks!
a***y (1342)- Bewertung vom Käufer.
Letzter Monat
Bestätigter Kauf
Great book!
Produktbewertungen & Rezensionen
Noch mehr entdecken:
- Alan Moore Belletristik-Bücher,
- Christopher Moore Belletristik-Bücher,
- Masters of the Universe Jugendliche Hörbücher und Hörspiele,
- Masters of the Universe Jugendliche Hörbücher und Hörspiele,
- Erwachsene Masters of the Universe Hörbücher und Hörspiele,
- Masters-of-the-Universe - Europa-Editions Hörbücher und Hörspiele,
- Natur- & - Umwelt-Sachbuch Bücher über Natur,
- Bücher über Natur Sachbuch,
- Bücher über Natur Sachbuch Bilder,
- Natur- & - Umwelt-Sachbuch Bücher