Commencez à lire Algorithms sur votre Kindle dans moins d'une minute. Vous n'avez pas encore de Kindle ? Achetez-le ici Ou commencez à lire dès maintenant avec l'une de nos applications de lecture Kindle gratuites.

Envoyer sur votre Kindle ou un autre appareil

 
 
 

Essai gratuit

Découvrez gratuitement un extrait de ce titre

Envoyer sur votre Kindle ou un autre appareil

Tout le monde peut lire les livres Kindle, même sans un appareil Kindle, grâce à l'appli Kindle GRATUITE pour les smartphones, les tablettes et les ordinateurs.
Algorithms
 
Agrandissez cette image
 

Algorithms [Print Replica] [Format Kindle]

Sanjoy Dasgupta , Christos Papadimitriou , Umesh Vazirani
5.0 étoiles sur 5  Voir tous les commentaires (1 commentaire client)

Prix éditeur - format imprimé : EUR 44,98
Prix Kindle : EUR 30,13 TTC & envoi gratuit via réseau sans fil par Amazon Whispernet
Économisez : EUR 14,85 (33%)

Formats

Prix Amazon Neuf à partir de Occasion à partir de
Format Kindle EUR 30,13  
Broché EUR 45,95  
Chaque jour, un ebook avec au moins 60% de réduction
Découvrez l'Offre Éclair Kindle et inscrivez-vous à la Newsletter Offre Éclair Kindle pour ne rater aucun ebook à prix exceptionnel. Abonnez-vous dès maintenant



Le Pack de la Rentrée : 24 applis offertes, plus de 50 euros d'économies, jusqu'au 4 septembre sur l'App-Shop pour Android. Profitez-en et partagez la nouvelle. En savoir plus.


Les clients ayant acheté cet article ont également acheté


Descriptions du produit

Présentation de l'éditeur

This text explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence. An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. "Algorithms" is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject.

Détails sur le produit

  • Format : Format Kindle
  • Taille du fichier : 4976 KB
  • Nombre de pages de l'édition imprimée : 336 pages
  • Utilisation simultanée de l'appareil : Jusqu'à  appareils simultanés, selon les limites de l'éditeur
  • Editeur : Science Engineering & Math; Édition : 1 (1 décembre 2011)
  • Vendu par : Amazon Media EU S.à r.l.
  • Langue : Anglais
  • ASIN: B006Z0QR3I
  • Synthèse vocale : Non activée
  • X-Ray :
  • Moyenne des commentaires client : 5.0 étoiles sur 5  Voir tous les commentaires (1 commentaire client)
  •  Souhaitez-vous faire modifier les images ?


En savoir plus sur les auteurs

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

Commentaires en ligne 

4 étoiles
0
3 étoiles
0
2 étoiles
0
1 étoiles
0
5.0 étoiles sur 5
5.0 étoiles sur 5
Commentaires client les plus utiles
5.0 étoiles sur 5 Excellent livre pour amateur averti 16 novembre 2012
Par arrtes
Format:Broché|Achat vérifié
Ce livre est une excellente introduction à l'informatique théorique. Les choix pédagogiques sont très pertinents et la lecture de ce livre n'en est que plus agréable. Quiconque voulant s'initier à l'informatique théorique pourra acquérir un base solide en la matière en lisant activement ce livre. Sans être exhaustif sur le sujet mais cependant très riche et très complet, l'ouvrage aborde les sujets classiques parmi lesquels la récursivité, les graphes, les algorithmes gloutons, la programmation dynamique, la NP-complétude. Il propose un chapitre terminal sur le thème des algorithmes quantiques et peut constituer en cela une introduction à ce sujet. La complexité est omniprésente dans l'analyse des algorithmes. De nombreux exemples illustrent les concepts et des anecdotes rendent la lecture de ce livre passionnante. Enfin, les nombreux exercices complètent très largement l'ouvrage. Un livre très pédagogique pour tous les passionnés de l'informatique théorique...
Avez-vous trouvé ce commentaire utile ?
Commentaires client les plus utiles sur Amazon.com (beta)
Amazon.com: 3.8 étoiles sur 5  46 commentaires
51 internautes sur 53 ont trouvé ce commentaire utile 
3.0 étoiles sur 5 Available online for free; lacks some details and explanation 20 décembre 2008
Par Kenyon Ralph - Publié sur Amazon.com
Format:Broché|Achat vérifié
The entire book is available in PDF on Vazirani's website here: [...]

The website says "draft" but it's the same or better (errata corrected) than the print version. (I accidentally bought the print version even though I knew about the PDF. At least I was able to resell it for [...])

I used this book for CSE 101 Design and Analysis of Algorithms at UCSD. It's OK, but the level of detail of algorithms was too low for me to use just this book. I sometimes had to reference Wikipedia and other publications to achieve complete understanding.
58 internautes sur 66 ont trouvé ce commentaire utile 
5.0 étoiles sur 5 a masterpiece 13 mars 2007
Par T. Liu - Publié sur Amazon.com
Format:Broché
As a professor in a state university, I learn, teach, and research on computer algorithms. Not many computer books are a joy to read, but

this one is exceptional: It is concise, informative, and inspiring.

I don't know since when computer books are synonymous to boring, lengthy

piles of printed papers filled with screen dumps. Truely innovative

books are rare. Not only does this book explain algorithms clearly, it also tells the stories behind them.

I would consider this book a good complement rather than a substitution

to Corman et al's book Introduction to Algorithms (which is one of the

most widely used textbook for algorithm course). If you just want to

find a book where you can translate the suedo code into a program, this

is not for you. The focus of this book is to explain and to inspire (which is also what I believe the real "Education" should be) rather than

dumping the students' head with codes and rules.

I would also like to mention that the book "the design and analysis of

algorithms" is also a good one. It is good for most colleges at undergraduate level except for a few "top-level" universities.
11 internautes sur 12 ont trouvé ce commentaire utile 
5.0 étoiles sur 5 An excellent and small choice for a textbook in algorithms 9 septembre 2008
Par Charles Ashbacher - Publié sur Amazon.com
Format:Broché
One of the most appealing characteristics of this book is the small size. Textbooks in algorithms are similar to those of other fields in that they have continued to increase in girth over the years. At 320 pages, this book is a relative midget.
However, that does not in any way mean that it is weak in content, there is plenty of material for a one-semester course in algorithms. The chapters are:

*) Prologue - a bit of history and the big-O notation
*) Algorithms with numbers - basic and modular arithmetic, primality testing and cryptography
*) Divide-and-conquer algorithms - multiplication, recurrence relations, mergesort, matrix multiplication and the Fast Fourier Transform (FFT).
*) Decomposition of graphs - the fundamental definition of directed and undirected graphs and performing depth-first searches.
*) Paths in graphs- basic algorithms used in graph searches
*) Greedy algorithms - some fundamental greedy algorithms and their basic level of performance
*) Dynamic programming - shortest paths, knapsack optimization and independent sets in trees
*) Linear programming and reductions - the definition of linear programming and some of the standard problems that it can be used to solve
*) NP-complete problems - definition of NP-complete, some examples and reduction strategies used to show NP equivalence
*) Coping with NP-completeness - intelligent search, approximation and random algorithms
*) Quantum algorithms - a brief foray into a possible revolution in computing. Explanations of how data may be stored and processed at the quantum level.

The explanations are brief yet thorough enough for advanced computer science students, the algorithms are presented in a generic pseudocode. A large set of exercises are included at the end of the chapters, the expectation is that the solutions will be expressed in pseudocode.
Despite the compactness of the presentation, this book is a worthy choice for the textbook in an algorithms course for upper level computer science majors.
26 internautes sur 33 ont trouvé ce commentaire utile 
2.0 étoiles sur 5 Skip this one 26 octobre 2011
Par cellularAutomata - Publié sur Amazon.com
Format:Broché
As a student of computer science, I am writing this review from the perspective of someone who is learning algorithms, not someone who is a professor or a professional in the industry. I am fascinated by the theoretical aspects of computation, and as such have no inherent negative bias about the material content of Algorithms(quite the opposite, in fact). As such, I was very much excited to take my first course in algo(which used this book), and I look forward to taking more courses in algo, all because I learned so much...from Cormen, Leiserson, Rivest, and Stein's Introduction to Algorithms.

Oh yes, the review.
This book is terrible. Absolutely terrible.

Algorithms is not an easy subject to learn(and by learn, I mean actually understand the underlying theory, not just devour psuedocode, as one author previously noted). It is vital that equations/relations and psuedocode(it can be a valuable learning aid) are backed up by their respective theorems and lemmas in order to gain a sense of what is actually going on, which this book neglects to do.

Also, for those humble few(read: vast majority) of students who don't simply consume recurrence relations with one glance, some examples are kind of nice here and there. The rare instances of examples in this book effectively consist of a picture with little to no explanation whatsoever, often times without any solution to go by. Also, this book leaves way too much up to the reader(the damnable phrase "do you see why?" infects nearly every page).
Forcing the reader to think on their own every now and then should be relegated to the realm of practice sets. When you are trying to read something and understand, being denied explanations is downright insulting.

And don't even get me started on chapter 6.
Their take on "Dynamic Programming" is a modern testament to terseness. It is the most clandestine take on a topic that already has a pronounced mental barrier to entry.
Recursion is best explained by some examples, of which there are virtually none.
At one point, under 6.6 - Shortest paths, there is a paragraph followed by a formula followed by the phrase "Need we say more?"
That is all. It is a revealing instance of an arrogant and condescending theme that permeates the entire book.

Contrast this with Cormen et all, which provides numerous examples, derivations, and underlying theory. It takes longer to work through a chapter in Cormen, but that is because you are actually learning(the psuedocode their is longer than 4 lines, which gives you a better tool with which to work through examples). Also, there are actual proofs! Imagine that, proofs in an algorithms book. No wonder serious people have been using this book for many years.

The authors of this work should really feel a genuine sense of shame for foisting this travesty on the world of academia - aiming it specifically at an entry level text. After reading his book on Computational Complexity, I really expected more from Papadimitriou(for continuity purposes, I read this work after my course in algo). In fact, the two are so vastly disjoint in feel and substance that I doubt that Papadimitriou had anything to do with this text at all.

If you have already had a course in algorithms and need a quick review, then yes, this book would probably be quite ideal for you. If you are trying to learn algorithms for the first time, don't go near this thing. Just use Cormen et all or something else(MIT opencourseware is a nice supplement). And professors, if you are considering using this book in your class, I would assert that from a students perspective(and I think I speak for most of my classmates when I say this, going by what I've heard in passing and in person), this book is inhibitive and the concepts throughly obfuscated beyond hope. Please consider using something else.

I would also like to make one final note. I consider my self an average student. I am not gifted with extreme intelligence, but I do posses a decent aptitude for mathematics. I am above all else, a dedicated and hard worker. Generally, when I read a chapter several times, I can extract a pretty solid understanding of what is going on. With this book, rereading just invokes a sense of frustration. Stay away.
18 internautes sur 22 ont trouvé ce commentaire utile 
5.0 étoiles sur 5 My first choice as an instructor 4 mars 2008
Par John R. Black - Publié sur Amazon.com
Format:Broché
I occasionally teach algorithms at CU Boulder to our undergraduates. This book accomplishes what it set out to do: provide a comprehensible (but not comprehensive) treatment of a core piece of Computer Science at an affordable cost.

That we get one of the greatest researchers in the area (Papadimitriou) alongside two other distinguished authors is just icing on the cake.

The first printing had numerous errors, though the online version of the book had already corrected many of them. I haven't used the book since then, but will in the Fall, and I'd expect with the vigor already invested by the authors, the book will be in even better shape.

I'm glad they wrote this thing.. it was long overdue.
Ces commentaires ont-ils été utiles ?   Dites-le-nous
Rechercher des commentaires
Rechercher uniquement parmi les commentaires portant sur ce produit

Discussions entre clients

Le forum concernant ce produit
Discussion Réponses Message le plus récent
Pas de discussions pour l'instant

Posez des questions, partagez votre opinion, gagnez en compréhension
Démarrer une nouvelle discussion
Thème:
Première publication:
Aller s'identifier
 

Rechercher parmi les discussions des clients
Rechercher dans toutes les discussions Amazon
   


Rechercher des articles similaires par rubrique