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.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 438705-n
Quantité disponible : Plus de 20 disponibles
Vendeur : Better World Books, Mishawaka, IN, Etats-Unis
Etat : Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. N° de réf. du vendeur 8769706-6
Quantité disponible : 1 disponible(s)
Vendeur : BargainBookStores, Grand Rapids, MI, Etats-Unis
Paperback or Softback. Etat : New. Introductory Discrete Mathematics. Book. N° de réf. du vendeur BBS-9780486691152
Quantité disponible : 3 disponible(s)
Vendeur : Goodwill of Central and Coastal Virginia, Richmond, VA, Etats-Unis
Etat : acceptable. N° de réf. du vendeur CCVV.0486691152.A
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 : Plus de 20 disponibles
Vendeur : Lakeside Books, Benton Harbor, MI, Etats-Unis
Etat : New. Brand New! Not Overstocks or Low Quality Book Club Editions! Direct From the Publisher! We're not a giant, faceless warehouse organization! We're a small town bookstore that loves books and loves it's customers! Buy from Lakeside Books! N° de réf. du vendeur OTF-S-9780486691152
Quantité disponible : 3 disponible(s)
Vendeur : Rarewaves USA, OSWEGO, IL, Etats-Unis
Paperback. Etat : New. This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. Geared toward mathematics and computer science majors, it emphasizes applications, offering more than 200 exercises to help students test their grasp of the material and providing answers to selected exercises. 1991 edition. N° de réf. du vendeur LU-9780486691152
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 : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9780486691152
Quantité disponible : 6 disponible(s)
Vendeur : Grand Eagle Retail, Bensenville, IL, 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)