Von dem Buch Introductory Discrete Mathematics . Author haben wir 3 gleiche oder sehr ähnliche Ausgaben identifiziert!
Falls Sie nur an einem bestimmten Exempar interessiert sind, können Sie aus der folgenden Liste jenes wählen, an dem Sie interessiert sind:
100%: V. K . Balakrishnan, V.K. Balakrishnan: Introductory Discrete Mathematics . Author (ISBN: 9780486691152) in Englisch, Taschenbuch.Nur diese Ausgabe anzeigen…
100%: V. K . Balakrishnan: Introductory Discrete Mathematics (ISBN: 9780486140384) 2012, in Englisch, auch als eBook.Nur diese Ausgabe anzeigen…
50%: Balakrishnan, V. K. M.D.: Introductory Discrete Mathematics by 1991 Hardcover (ISBN: 9780130399427) 1991, Lebanon, Indiana, U.S.A.: Prentice Hall, in Englisch, Broschiert.Nur diese Ausgabe anzeigen…
Introductory Discrete Mathematics . Author - 14 Angebote vergleichen
| Preise | 2016 | 2017 | 2021 | 2022 |
|---|---|---|---|---|
| Schnitt | Fr. 11.51 (€ 11.79)¹ | Fr. 10.62 (€ 10.88)¹ | Fr. 11.98 (€ 12.28)¹ | Fr. 14.62 (€ 14.98)¹ |
| Nachfrage |
1
Introductory Discrete Mathematics (2012)
EN NW EBISBN: 9780486140384 bzw. 0486140385, in Englisch, Dover Publications, neu, E-Book.
Lieferung aus: Niederlande, Direct beschikbaar.
bol.com.
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... 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. Productinformatie:Soort: Met illustraties;Taal: Engels;Formaat: ePub met kopieerbeveiliging (DRM) van Adobe;Kopieerrechten: Het kopiëren van (delen van) de pagina's is niet toegestaan ;Geschikt voor: Alle e-readers te koop bij bol.com (of compatible met Adobe DRM). Telefoons/tablets met Google Android (1.6 of hoger) voorzien van bol.com boekenbol app. PC en Mac met Adobe reader software;ISBN10: 0486140385;ISBN13: 9780486140384;Product breedte: 171 mm;Product hoogte: 13 mm;Product lengte: 235 mm; Engels | Ebook | 2012.
bol.com.
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... 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. Productinformatie:Soort: Met illustraties;Taal: Engels;Formaat: ePub met kopieerbeveiliging (DRM) van Adobe;Kopieerrechten: Het kopiëren van (delen van) de pagina's is niet toegestaan ;Geschikt voor: Alle e-readers te koop bij bol.com (of compatible met Adobe DRM). Telefoons/tablets met Google Android (1.6 of hoger) voorzien van bol.com boekenbol app. PC en Mac met Adobe reader software;ISBN10: 0486140385;ISBN13: 9780486140384;Product breedte: 171 mm;Product hoogte: 13 mm;Product lengte: 235 mm; Engels | Ebook | 2012.
2
Introductory Discrete Mathematics (1996)
EN PB NWISBN: 9780486691152 bzw. 0486691152, in Englisch, Dover Publications Inc. Taschenbuch, neu.
Lieferung aus: Niederlande, 3-4 werkdagen.
bol.com.
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..., 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. Soort: Met illustraties;Taal: Engels;Afmetingen: 13x233x165 mm;Gewicht: 386,00 gram;Verschijningsdatum: november 1996;Druk: 1;ISBN10: 0486691152;ISBN13: 9780486691152; Engelstalig | Paperback | 1996.
bol.com.
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..., 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. Soort: Met illustraties;Taal: Engels;Afmetingen: 13x233x165 mm;Gewicht: 386,00 gram;Verschijningsdatum: november 1996;Druk: 1;ISBN10: 0486691152;ISBN13: 9780486691152; Engelstalig | Paperback | 1996.
3
Introductory Discrete Mathematics (Dover Books on Computer Science) (2010)
EN PB USISBN: 9780486691152 bzw. 0486691152, in Englisch, 256 Seiten, Dover Publications, Taschenbuch, gebraucht.
Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days.
Von Händler/Antiquariat, Tropical Breeze Books.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Von Händler/Antiquariat, Tropical Breeze Books.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
4
Introductory Discrete Mathematics (Dover Books on Computer Science) (2010)
EN PB NWISBN: 9780486691152 bzw. 0486691152, in Englisch, 256 Seiten, Dover Publications, Taschenbuch, neu.
Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days.
Von Händler/Antiquariat, ---SuperBookDeals.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Von Händler/Antiquariat, ---SuperBookDeals.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
5
Introductory Discrete Mathematics V. K . Balakrishnan Author
~EN PB NWISBN: 9780486691152 bzw. 0486691152, vermutlich in Englisch, Dover Publications, Taschenbuch, neu.
Lieferung aus: Vereinigte Staaten von Amerika, En Stock, frais de port.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
6
Introductory Discrete Mathematics V. K . Balakrishnan Author
~EN NW EB DLISBN: 9780486140384 bzw. 0486140385, vermutlich in Englisch, Dover Publications, neu, E-Book, elektronischer Download.
Lieferung aus: Vereinigte Staaten von Amerika, En Stock.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
7
Introductory Discrete Mathematics
EN NWISBN: 9780486691152 bzw. 0486691152, in Englisch, Dover Publications, Vereinigtes Königreich Grossbritannien und Nordirland, neu.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
8
Symbolbild
Introductory Discrete Mathematics
EN NWISBN: 9780486691152 bzw. 0486691152, in Englisch, Dover Publications, Vereinigtes Königreich Grossbritannien und Nordirland, neu.
Lieferung aus: Vereinigte Staaten von Amerika, Lagernd, zzgl. Versandkosten.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
9
Introductory Discrete Mathematics
EN NW EBISBN: 9780486691152 bzw. 0486691152, in Englisch, Dover Publications, neu, E-Book.
Lieferung aus: Vereinigte Staaten von Amerika, Ebook for download.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
10
Introductory Discrete Mathematics
EN NWISBN: 9780486140384 bzw. 0486140385, in Englisch, Dover Publications, Vereinigtes Königreich Grossbritannien und Nordirland, neu.
Lieferung aus: Deutschland, zzgl. Versandkosten, Sofort per Download lieferbar.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Lade…