Photo 1 sur 6
Galerie
Photo 1 sur 6
Vous en avez un à vendre?
Livre de poche introductif mathématiques discrètes V. K. Balakrishnan Paperback Dover
8,79 $US
Environ12,11 $C
Était 10,99 $US (20 % de rabais)
État :
Très bon
Un livre qui n’a pas l’air neuf et qui a été lu, mais qui est en excellent état. La couverture ne présente aucun dommage apparent et la jaquette (si applicable) est incluse (dans le cas des livres à reliure). Il n'y a aucune page manquante ou endommagée, aucun pli, aucune déchirure, aucun passage surligné ou souligné et aucune inscription en marge. Il est possible que le contreplat porte d'infimes marques d'identification. Le livre présente des traces d'usure infimes.
La vente se termine dans : 8 h 22 m
- Achat immédiatLivre de poche introductif mathématiques discrètes V. K. Balakrishnan Paperback Dover
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Expédition :
8,24 $US (environ 11,35 $C) USPS Ground Advantage®.
Lieu : Milwaukee, Wisconsin, États-Unis
Livraison :
Livraison prévue entre le ven. 8 août et le jeu. 14 août à 94104
Renvois :
Renvoi sous 14 jours. L'acheteur paie les frais de renvoi. Si vous utilisez une étiquette d'envoi eBay, son coût sera déduit du montant de votre remboursement.
Paiements :
Magasinez en toute confiance
Le vendeur assume l'entière responsabilité de cette annonce.
Numéro de l'objet eBay :156861962777
Dernière mise à jour : avr. 05, 2025 20:28:16 HAEAfficher toutes les modificationsAfficher toutes les modifications
Caractéristiques de l'objet
- État
- ISBN
- 9780486691152
À propos de ce produit
Product Identifiers
Publisher
Dover Publications, Incorporated
ISBN-10
0486691152
ISBN-13
9780486691152
eBay Product ID (ePID)
961798
Product Key Features
Number of Pages
256 Pages
Language
English
Publication Name
Introductory Discrete Mathematics
Publication Year
2010
Subject
Programming / Algorithms, Reference, Computer Science, Discrete Mathematics
Type
Textbook
Subject Area
Mathematics, Computers
Series
Dover Books on Computer Science Ser.
Format
Trade Paperback
Dimensions
Item Height
0.5 in
Item Weight
13.2 Oz
Item Length
9.2 in
Item Width
6.5 in
Additional Product Features
Intended Audience
College Audience
LCCN
95-052384
Dewey Edition
20
Illustrated
Yes
Dewey Decimal
511
Table Of Content
Preface 0 Set Theory and Logic 0.1 Introduction to Set Theory 0.2 Functions and Relations 0.3 Inductive Proofs and Recursive Definitions 0.4 The Language of Logic 0.5 Notes and References 0.6 Exercises 1 Combinatorics 1.1 Two Basic Counting Rules 1.2 Permutations 1.3 Combinations 1.4 More on Permutations and Combinations 1.5 The Pigeonhole Principle 1.6 The Inclusion-Exclusion Principle 1.7 Summary of Results in Combinatorics 1.8 Notes and References 1.9 Exercises 2 Generating Functions 2.1 Introduction 2.2 Ordinary Generating Functions 2.3 Exponential Generating Functions 2.4 Notes and References 2.5 Exercises 3 Recurrence Relations 3.1 Introduction 3.2 Homogeneous Recurrence Relations 3.3 Inhomogeneous Recurrence Relations 3.4 Recurrence Relations and Generating Functions 3.5 Analysis of Alogorithms 3.6 Notes and References 3.7 Exercises 4 Graphs and Digraphs 4.1 Introduction 4.2 Adjacency Matrices and Incidence Matrices 4.3 Joining in Graphs 4.4 Reaching in Digraphs 4.5 Testing Connectedness 4.6 Strong Orientation of Graphs 4.7 Notes and References 4.8 Exercises 5 More on Graphs and Digraphs 5.1 Eulerian Paths and Eulerian Circuits 5.2 Coding and de Bruijn Digraphs 5.3 Hamiltonian Paths and Hamiltonian Cycles 5.4 Applications of Hamiltonian Cycles 5.5 Vertex Coloring and Planarity of Graphs 5.6 Notes and References 5.7 Exercises 6 Trees and Their Applications 6.1 Definitions and Properties 6.2 Spanning Trees 6.3 Binary Trees 6.4 Notes and References 6.5 Exercises 7 Spanning Tree Problems 7.1 More on Spanning Trees 7.2 Kruskal's Greedy Algorithm 7.3 Prim's Greedy Algorithm 7.4 Comparison of the Two Algorithms 7.5 Notes and References 7.6 Exercises 8 Shortest Path Problems 8.1 Introduction 8.2 Dijkstra's Algorithm 8.3 Floyd-Warshall Algorithm 8.4 Comparison of the Two Algorithms 8.5 Notes and References 8.6 Exercises Appendix What is NP-Completeness? A.1 Problems and Their Instances A.2 The Size of an Instance A.3 Algorithm to Solve a Problem A.4 Complexity of an Algorithm A.5 "The "Big Oh" or the O(·) Notation" A.6 Easy Problems and Difficult Problems A.7 The Class P and the Class NP A.8 Polynomial Transformations and NP-Completeness A.9 Coping with Hard Problems Bibliography Answers to Selected Exercises Index
Edition Description
Reprint,New Edition
Synopsis
Concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms to solve these problems. Applications are emphasized and more than 200 exercises help students test their grasp of the material. Appendix. Bibliography. Answers to Selected Exercises., 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., 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., 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 03 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., 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.
LC Classification Number
QA39.2.B35
Description de l'objet du vendeur
Évaluations comme vendeur (166)
- r***2 (141)- Évaluation laissée par l'acheteur.Six derniers moisAchat vérifiéPrezioso articolo fuori commercio, perfettamente corrispondente alla descrizione e alle immagini fornite dal venditore. Spedizione rapida e d economica. Confezionato con cura, l'articolo è arrivato a destinazione in perfette condizioni. Venditore assolutamente consigliato!Too Faced Christmas Bake Shoppe Limited Edition 3 Face & Eye Shadow Palettes Set (#156486160940)
- e***c (636)- Évaluation laissée par l'acheteur.Six derniers moisAchat vérifiéSeveral other sellers with this fabric but I selected this one bc of the fast shipping reviews. I did not receive that. I waited 2 days and contacted the seller asking when it was going to be shipped. With a quick response they answered it would be tomorrow. I was hoping the turn around service of 1 day as advertised.Réponse de : flomengco- Évaluations auxquelles le vendeur (flomengco) a répondu.- Évaluations auxquelles le vendeur (flomengco) a répondu.So sorry that you were not satisfied with the shipping. We received your payment on Friday, 6/13/2025. The next business day for shipping would have been Monday, 6/16/25, but because you reached out, we made a special trip to the post office to ensure your satisfaction. Your order was shipped out on Saturday morning, 6/14/2025, instead.
- .***k (149)- Évaluation laissée par l'acheteur.Dernière annéeAchat vérifiéThe product was exactly as described. The condition was great. Great value. The seller had fast shipping as was great to deal with,3/8" Braided Elastic White Band 144 yards Roll 9.5mm Polyester & Latex Thread (#156128928497)
Évaluations et avis sur le produit
Avis les plus pertinents
- juin 06, 2025
Really great book! Lots of information.....
Achat vérifié : OuiÉtat : NeufVendu par : rarewaves-usa-ca
Évaluations comme vendeur (166)
- r***2 (141)- Évaluation laissée par l'acheteur.Six derniers moisAchat vérifiéPrezioso articolo fuori commercio, perfettamente corrispondente alla descrizione e alle immagini fornite dal venditore. Spedizione rapida e d economica. Confezionato con cura, l'articolo è arrivato a destinazione in perfette condizioni. Venditore assolutamente consigliato!Too Faced Christmas Bake Shoppe Limited Edition 3 Face & Eye Shadow Palettes Set (#156486160940)
- e***c (636)- Évaluation laissée par l'acheteur.Six derniers moisAchat vérifiéSeveral other sellers with this fabric but I selected this one bc of the fast shipping reviews. I did not receive that. I waited 2 days and contacted the seller asking when it was going to be shipped. With a quick response they answered it would be tomorrow. I was hoping the turn around service of 1 day as advertised.Réponse de : flomengco- Évaluations auxquelles le vendeur (flomengco) a répondu.- Évaluations auxquelles le vendeur (flomengco) a répondu.So sorry that you were not satisfied with the shipping. We received your payment on Friday, 6/13/2025. The next business day for shipping would have been Monday, 6/16/25, but because you reached out, we made a special trip to the post office to ensure your satisfaction. Your order was shipped out on Saturday morning, 6/14/2025, instead.
- .***k (149)- Évaluation laissée par l'acheteur.Dernière annéeAchat vérifiéThe product was exactly as described. The condition was great. Great value. The seller had fast shipping as was great to deal with,3/8" Braided Elastic White Band 144 yards Roll 9.5mm Polyester & Latex Thread (#156128928497)