Vous l'avez déjà ?
Repliez vers l'arrière Repliez vers l'avant
Ecoutez Lecture en cours... Interrompu   Vous écoutez un extrait de l'édition audio Audible
En savoir plus
Voir cette image

GEMS OF THEORETICAL COMPUTER SCIENCE (Anglais) Relié – 30 octobre 1998

Voir les formats et éditions Masquer les autres formats et éditions
Prix Amazon Neuf à partir de Occasion à partir de
"Veuillez réessayer"
EUR 340,64 EUR 56,67

Devenez auteur avec Kindle Direct Publishing Devenez auteur avec Kindle Direct Publishing

Offres spéciales et liens associés

Détails sur le produit

En savoir plus sur l'auteur

Découvrez des livres, informez-vous sur les écrivains, lisez des blogs d'auteurs et bien plus encore.

Commentaires en ligne

Il n'y a pas encore de commentaires clients sur Amazon.fr
5 étoiles
4 étoiles
3 étoiles
2 étoiles
1 étoiles

Commentaires client les plus utiles sur Amazon.com (beta)

Amazon.com: 3 commentaires
11 internautes sur 11 ont trouvé ce commentaire utile 
5 1/2 stars 15 novembre 2000
Par Giuseppe A. Paleologo - Publié sur Amazon.com
Format: Relié
This book is somewhat similar to another wonderful book by Springer-Verlag: "Proof from the Book" by Aigner and Ziegler. Both books illustrate the sheer beauty of selected theorems and proof techniques rather than develop systematically a discipline. As a result, reading is an adventure rather than a task. The pace is brisk, the writing style is direct. The reader is left with the impression that there is much research to do, and that mathematics is not cast in stone or heavy handbooks, but is a growing body of knowledge. Therefore, I would suggest this book to any beginning researcher in Computer Science, Mathematics, or Operation Research.
There are 26 lectures, covering well-known topics as well as rather obscure ones. To give the reader a flavor of the book here are some:
PAC-learning and Occam's razor;
Kolmogorov complexity, the universal distribution, and worst-case vs. average-case;
Hilbert's 10th problem;
P=NP with probability;
The Berman-Hartmanis conjecture;
Lower bounds for the parity function;
Quantum search algorithms.
The book is suitable for advanced undergraduates and beginning graduate students. Overall, this book proves once again that Springer-Verlag is among the best publishers in the mathematical sciences, and is definitely the most innovative in mathematical education.
2 internautes sur 2 ont trouvé ce commentaire utile 
interactive teaching style works very well 14 juin 2005
Par Nimar S. Arora - Publié sur Amazon.com
Format: Relié
This book gives the reader an introduction to the beauty and complexity of many different research areas in theoretical computer science.

Each chapter is self-contained, and there are no exercises at the end of a chapter. Instead, the exercises are sprinkled throughout each chapter and help to develop the results presented. This interactive style forces one to think more deeply about each proof.

Of course, the interactive style and the depth of some of the results make this book a very slow and hard read. However, I would say, the book is worth every hour spent on it.
1 internautes sur 8 ont trouvé ce commentaire utile 
great book! 27 mars 2000
Par Shimon Kogan - Publié sur Amazon.com
Format: Relié
this book realy makes you see the beauty in theoretical computer science.
Ces commentaires ont-ils été utiles ? Dites-le-nous


Souhaitez-vous compléter ou améliorer les informations sur ce produit ? Ou faire modifier les images?