Introductory Discrete Mathematics (Paperback)

V.K. Balakrishnan

44 valutazioni di Goodreads

Lingua: inglese

Editore: Dover Publications Inc., New York, 2000

0486691152 / 9780486691152

Serie: Libro 3 di 19 - Dover Books on Computer Science

Da: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller

Venditore con 5 stelle

Venditore AbeBooks dal 22 giugno 2007

Visualizza gli articoli di questo venditore
Brossura

Condizione: Nuovo

EUR 36,66

EUR 31,90 spedizione 
Spedito da Australia a U.S.A.

Quantità: 1 disponibili

Aggiungi al carrello
Resi gratuiti per 30 giorni

Descrizione dell’articolo da parte del venditore

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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Codice articolo 9780486691152

Titolo
Introductory Discrete Mathematics (Paperback)
Autore
V.K. Balakrishnan
Editore
Dover Publications Inc., New York
Anno di pubblicazione
2000
Condizione
new
Rilegatura
Paperback
Lingua
inglese
ISBN 10
0486691152
ISBN 13
9780486691152
Serie
Libro 3 di 19: Dover Books on Computer Science

AussieBookSeller

Truganina, VIC, Australia

Venditore con 5 stelle

Venditore AbeBooks dal 22 giugno 2007

Tariffe di spedizione da Australia a U.S.A.

ArticoloDa 25 a 45 giorni lavorativiDa 8 a 14 giorni lavorativi
Primo articoloEUR 31,90EUR 37,93
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.

Metodi di pagamento

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay

Informazioni sull’azienda del venditore

The Nile Group Pty Ltd

42 Apex Drive
Truganina, VIC Australia 3029