Introductory Discrete Mathematics (Dover Books on Computer Science)
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
V. K. Balakrishnan is Professor Emeritus at the University of Maine.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 3,41 expédition vers Etats-Unis
Destinations, frais et délaisEUR 2,26 expédition vers Etats-Unis
Destinations, frais et délaisVendeur : Books Liquidation, Sacramento, CA, Etats-Unis
paperback. Etat : Good. N° de réf. du vendeur 53IN3G003HMB
Quantité disponible : 1 disponible(s)
Vendeur : clickgoodwillbooks, Indianapolis, IN, Etats-Unis
Etat : acceptable. Used - Acceptable: All pages and the cover are intact, but shrink wrap, dust covers, or boxed set case may be missing. Pages may include limited notes, highlighting, or minor water damage but the text is readable. Item may be missing bundled media. N° de réf. du vendeur 3O6JUN001MJX_ns
Quantité disponible : 1 disponible(s)
Vendeur : Used Book Company, Egg Harbor Township, NJ, Etats-Unis
Etat : LikeNew. Shows very minimal signs of wear and previous use. A portion of your purchase benefits nonprofits! - Note: Edition format may differ from what is shown in stock photo item details. May not include supplementary material (toys, access code, dvds, etc). N° de réf. du vendeur 584XQ4000BSA_ns
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 438705
Quantité disponible : 3 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 438705-n
Quantité disponible : 3 disponible(s)
Vendeur : INDOO, Avenel, NJ, Etats-Unis
Etat : New. Brand New. N° de réf. du vendeur 9780486691152
Quantité disponible : Plus de 20 disponibles
Vendeur : gwdetroit, Detroit, MI, Etats-Unis
Etat : Good. This Book is in GOOD condition. It is perfectly readable with cosmetic issues. It may have curled corners or stickers on the cover. The pages are clean, but may include light highlighting. Buyer should assume that no extra materials such as codes or disks will be included. The cover is like new! WE DO NOT SELL TOYS! Fast Shipping - Safe and Secure Bubble Mailer! Thank you for supporting Goodwill Detroit! N° de réf. du vendeur 4HQRTM001P69
Quantité disponible : 1 disponible(s)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Feb2215580230257
Quantité disponible : 1 disponible(s)
Vendeur : Best Price, Torrance, CA, Etats-Unis
Etat : New. SUPER FAST SHIPPING. N° de réf. du vendeur 9780486691152
Quantité disponible : 3 disponible(s)
Vendeur : Grand Eagle Retail, Mason, OH, Etats-Unis
Paperback. Etat : new. Paperback. 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 colouring, 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. This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. More than 200 exercises, many with complete solutions. 1991 edition. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9780486691152
Quantité disponible : 1 disponible(s)