Description
Book Synopsis: 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
Details
Are you fascinated by the beauty of computational complexity but find the formalism overwhelming? Look no further! Introducing "The Nature of Computation", a book that brilliantly bridges the gap between complex mathematical concepts and accessibility for both computer scientists and non-computer scientists alike.
Imagine finally understanding the deep ideas of theoretical computer science without getting lost in unnecessary jargon. This book unravels the mystery behind theoretical computer science in a clear and enjoyable fashion, making it accessible to anyone who wants to truly grasp the essence of this fascinating field.
Starting with the famous P vs. NP problem, the authors take you on a captivating journey through mazes, games, optimization, and even the outer reaches of quantum computing. They explain why the P vs. NP problem is so fundamental and why finding a resolution is an incredibly tough feat. But fear not, they guide you through each step with a minimum of formalism, ensuring that the explanations are both deep and accessible.
Whether you're a graduate or undergraduate looking to enhance your knowledge or a scientist from another field yearning to understand theoretical computer science, "The Nature of Computation" is the ultimate resource. Even experts in the field will fall in love with the subject all over again thanks to the book's lucid and playful approach.
Don't miss out on the opportunity to discover the beauty of computational complexity in a way that resonates with you. Get your copy of "The Nature of Computation" and embark on a fascinating journey of understanding that will transform your perspective. To request your copy of the Solutions Manual, click here.
Discover More Best Sellers in Chemistry
Shop Chemistry
The Science of Stress: Living Under Pressure
$74.08


Standard Methods for the Examination of Water and Wastewater, 24th Edition
$376.00


Timefulness: How Thinking Like a Geologist Can Help Save the World
$14.74


ISE General, Organic, & Biological Chemistry (ISE HED WCB CHEMISTRY)
$61.89


Chemistry and Our Universe: How It All Works
$51.99


Netter's Essential Biochemistry (Netter Basic Science)
$63.99


Race for a Remedy: The Science and Scientists behind the Next Life-Saving Cancer Medicine
$29.95


Chemistry: The Molecular Nature of Matter and Change
$139.22
