Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Spese di spedizione:
EUR 3,73
In U.S.A.
Descrizione libro Condizione: 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!. Codice articolo OTF-S-9780486691152
Descrizione libro Condizione: New. Codice articolo 438705-n
Descrizione libro Condizione: New. Codice articolo ABLIING23Feb2215580230257
Descrizione libro Condizione: New. Book is in NEW condition. Codice articolo 0486691152-2-1
Descrizione libro Condizione: New. New! This book is in the same immaculate condition as when it was published. Codice articolo 353-0486691152-new
Descrizione libro Paperback. Condizione: 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. Codice articolo 9780486691152
Descrizione libro paperback. Condizione: New. Language: ENG. Codice articolo 9780486691152
Descrizione libro Paperback. Condizione: new. New. Fast Shipping and good customer service. Codice articolo Holz_New_0486691152
Descrizione libro Paperback. Condizione: new. New. Codice articolo Wizard0486691152
Descrizione libro Paperback. Condizione: new. New Copy. Customer Service Guaranteed. Codice articolo think0486691152