L'édition de cet ISBN n'est malheureusement plus disponible.
Afficher les exemplaires de cette édition ISBNLes informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Frais de port :
EUR 3,67
Vers Etats-Unis
Description du livre Etat : New. Brand New. N° de réf. du vendeur 9780486691152
Description du livre Etat : New. Book is in NEW condition. 0.7. N° de réf. du vendeur 0486691152-2-1
Description du livre Etat : New. New! This book is in the same immaculate condition as when it was published 0.7. N° de réf. du vendeur 353-0486691152-new
Description du livre paperback. Etat : New. . N° de réf. du vendeur 52GZZZ00LK6N_ns
Description du livre Softcover. Etat : New. This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the interplay between computer science and mathematics. The present volume emphasizes combinatorics, graph theory with applications to some stand network optimization problems, and algorithms to solve these problems.Chapters 0-3 cover fundamental operations involving sets and the principle of mathematical induction, and standard combinatorial topics: basic counting principles, permutations, combinations, the inclusion-exclusion principle, generating functions, recurrence relations, and an introduction to the analysis of algorithms. Applications are emphasized wherever possible and more than 200 exercises at the ends of these chapters help students test their grasp of the material.Chapters 4 and 5 survey graphs and digraphs, including their connectedness properties, applications of graph coloring, and more, with stress on applications to coding and other related problems. Two important problems in network optimization - the minimal spanning tree problem and the shortest distance problem - are covered in the last two chapters. A very brief nontechnical exposition of the theory of computational complexity and NP-completeness is outlined in the appendix. N° de réf. du vendeur DADAX0486691152
Description du livre Paperback. Etat : new. New. N° de réf. du vendeur Wizard0486691152
Description du livre Paperback. Etat : new. Buy for Great customer experience. N° de réf. du vendeur GoldenDragon0486691152
Description du livre Paperback. Etat : new. New Copy. Customer Service Guaranteed. N° de réf. du vendeur think0486691152
Description du livre Paperback. Etat : new. Brand New Copy. N° de réf. du vendeur BBB_new0486691152
Description du livre Etat : new. N° de réf. du vendeur FrontCover0486691152