- Hem
- Böcker
- Kurslitteratur
- Matematik & Naturvetenskap
- The Nature of Computation (inbunden, eng)
The Nature of Computation (inbunden, eng)
Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences rangin...
1 279 kr
Bara 4 kvar
Skickas inom 2-3 vardagar
- Fri frakt
Fri frakt över 299:-
Snabb leverans
Fria returer
Produktbeskrivning
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.
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.
Format | Inbunden |
Omfång | 1008 sidor |
Språk | Engelska |
Förlag | Oxford University Press |
Utgivningsdatum | 2011-08-11 |
ISBN | 9780199233212 |
Specifikation
Böcker
- Inbunden, 1008, Engelska, Oxford University Press, 2011-08-11, 9780199233212
Leverans
Vi erbjuder flera smidiga leveransalternativ beroende på ditt postnummer, såsom Budbee Box, Early Bird, Instabox och DB Schenker. Vid köp över 299 kr är leveransen kostnadsfri, annars tillkommer en fraktavgift från 29 kr. Välj det alternativ som passar dig bäst för en bekväm leverans.
Betalning
Du kan betala tryggt och enkelt via Avarda med flera alternativ: Swish för snabb betalning, kortbetalning med VISA eller MasterCard, faktura med 30 dagars betalningstid, eller konto för flexibel delbetalning.
Specifikation
Böcker
- Format Inbunden
- Antal sidor 1008
- Språk Engelska
- Förlag Oxford University Press
- Utgivningsdatum 2011-08-11
- ISBN 9780199233212