- Main
- Mathematics - Computational Mathematics
- The Nature of Computation
The Nature of Computation
Cristopher Moore, Stephan MertensAvez-vous aimé ce livre?
Quelle est la qualité du fichier téléchargé?
Veuillez télécharger le livre pour apprécier sa qualité
Quelle est la qualité des fichiers téléchargés?
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.
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.
Catégories:
Année:
2011
Editeur::
Oxford University Press, USA
Langue:
english
Pages:
1032
ISBN 10:
0199233217
ISBN 13:
9780199233212
Fichier:
PDF, 51.68 MB
Vos balises:
IPFS:
CID , CID Blake2b
english, 2011
Lire en ligne
- Télécharger
- pdf 51.68 MB Current page
- Checking other formats...
- Convertir en
- Débloquer la conversion des fichiers de plus de 8 MoPremium
Vous souhaitez ajouter une librairie ? Contactez-nous à support@z-lib.do
Le fichier sera envoyé à votre adresse de courriel dans 1 à 5 minutes.
Dans 1-5 minutes, le fichier sera delivré à votre compte Telegram.
Note : Assurez-vous que vous avez lié votre compte au bot Telegram de Z-Library.
Dans 1-5 minutes, le fichier sera delivré à votre appareil Kindle.
Remarque: vous devez valider chaque livre avant de l'envoyer à Kindle. Veuillez vérifier votre messagerie pour voir le mail avec la confirmation par Amazon Kindle Support.
La conversion en est effectuée
La conversion en a échoué
Avantages du statut Premium
- Envoyez aux e-lecteurs
- Limite de téléchargement augmentée
- Convertissez des fichiers
- Plus de résultats de recherche
- Autres avantages