Book by Moore Cristopher Mertens Stephan
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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)
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. ( David Saad, Aston University, Birmingham)
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)
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. ( American Scientist)
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Buchbeschreibung Oxford University Press Aug 2011, 2011. Buch. Buchzustand: Neu. 249x195x55 mm. Neuware - 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. 1004 pp. Englisch. Artikel-Nr. 9780199233212