ISBN: 9780199233212

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 o… Mehr…

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. Buch 25.4 x 20.0 x 5.5 cm , KNV Besorgung, KNV Besorgung<

2011, ISBN: 9780199233212

OUP Oxford, Hardcover, 1032 Seiten, Publiziert: 2011-08-11T00:00:01Z, Produktgruppe: Book, Hersteller-Nr.: 9780199233212, 2.35 kg, Verkaufsrang: 557394, Business & Home Office, Software &… Mehr…

OUP Oxford, Hardcover, 1032 Seiten, Publiziert: 2011-08-11T00:00:01Z, Produktgruppe: Book, Hersteller-Nr.: 9780199233212, 2.35 kg, Verkaufsrang: 557394, Business & Home Office, Software & Graphics, Computing & Internet, Subjects, Books, Physical Chemistry, Chemistry, Science, Nature & Maths, Applied Mathematics, Higher Education, States of Matter, Physics, Popular Science, Scientific, Technical & Medical, School Books : Promotion, 3e708b60-20fb-41e8-a18d-05c77fb89b4c_6001, 3e708b60-20fb-41e8-a18d-05c77fb89b4c_0, Arborist Merchandising Root, Books Global Store, 579c3025-5e5c-446b-80c9-b24e6fd5c94f_3601, 579c3025-5e5c-446b-80c9-b24e6fd5c94f_0, Special Features Stores, OUP Oxford, 2011<

2011, ISBN: 0199233217

[EAN: 9780199233212], Neubuch, [PU: KNV Besorgung], MATHEMATICS APPLIED SCIENCE CHEMISTRY PHYSICAL & THEORETICAL PHYSICS GENERAL, Why are some problems easy to solve, while others seem ne… Mehr…

[EAN: 9780199233212], Neubuch, [PU: KNV Besorgung], MATHEMATICS APPLIED SCIENCE CHEMISTRY PHYSICAL & THEORETICAL PHYSICS GENERAL, 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., Books<