Articoli correlati a 经典原版书库:离&#x...
- ISBN 10 7111385500
- ISBN 13 9787111385509
- RilegaturaCopertina flessibile
- LinguaCinese
Compra nuovo
Visualizza questo articolo
EUR 115,11
EUR 16,00 per la spedizione da Cina a U.S.A.
Destinazione, tempi e costiRisultati della ricerca per 经典原版书库:离&#x...
Foto dell'editore
Discrete Mathematics and Its Applications (7th Edition) (English)(Chinese Edition)
Da: HPB-Red, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
paperback. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Codice articolo S_312067205
Quantità: 1 disponibili
Foto dell'editore
Discrete Mathematics and Its Applications (7th Edition) (English)(Chinese Edition)
Da: Bookmans, Tucson, AZ, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Acceptable. Wear & Tear Satisfaction 100% guaranteed. Codice articolo mon0002282029
Quantità: 1 disponibili
Foto dell'editore
Discrete Mathematics and Its Applications (English version 7th Edition)(Chinese Edition)
Da: liu xing, Nanjing, JS, Cina
Valutazione del venditore 5 su 5 stelle
paperback. Condizione: New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Paperback. Pub Date: Unknown in Publisher: Machinery Industry Press List Price: 99.00 yuan Author: Publisher: Machinery Industry Press ISBN: 9787111385509 Yema: Revision: Binding: Folio: Published :2012 -9-1 printing time: Words: Goods ID: 22905114 Description Discrete Mathematics and Its Applications (English Edition) is a classic textbook introduces the theory and methods of discrete mathematics. has become the highest rate of adoption of discrete mathematics textbooks. many U.S. schools as a textbook obtained a great success. The Chinese version of this book has been widely adopted by domestic universities for teaching materials. Of reference books teachers and students feedback. and with their own insight into education. a lot of improvements in version 7. making it a more effective teaching tool. The book can be used as 1 to 2 semester discrete mathematics course materials. suitable for students of mathematics. computer science. computer engineering. information technology and other professional. About the author catalog the preface ivabout theauthor xiiithe companion website xivto the studentxvilist of the symbols xix1 the foundations: logic and proofs1.1 propositional logic1.2 applications of the of propositional logic1.3 the propositional equivalences1.4 predicates andquantifiers1.5 nested quantifiers1.6 the rules of inference1.7 introduction to proofs1.8 proofmethods and strategyend-of-chaptermaterial-2 basic structures: sets. functions. sequences. sums. andmatrices2.1 sets2.2 set operations2.3 functions.2.4 sequences and summations2.5 cardinality of sets2.6 matricesend-of-chaptermaterial3 algorithms3.1 algorithms3.2 the growth of functions3.3 complexity of algofithmsend-of-chapter material4 number theory and cryptography4.1 divisibilitv andmodular arithmetic4.2 integer representations andalgorithms4.3 primesand greatest common divisors4.4 solving congruences4. 5 applications of congruences4.6 cryptographyend-of-chapter material5 induction and recursion5.1 mathematical induction5.2 strong induction and well-ordering5.3 recursive definitions and structural induction5.4 recursive algorithms5.5 program correctnessend-of-chapter material6 counting6.1 tlle basics of counting6.2 the pigeonhole principle6.3 permutations and combinations6.4 binomial coefficients and identities6.5 generalized permutations and combinations6.6 generating permutations and combinationsend-of-chapter material7 discrete probability7.1 an introduction to discrete probability7.2 probability theory7 .3 bayes'theorem7 .4 expected value and varianceend-of-chapter material8 advanced counring technigues8.1 applications of recurrence relations8.2 solving linear recurrence relations8.3 divide-and-conquer algorithms and recurrencerelations8.4 generating functions8.5 inclusion-exclusion8 .6 applications of inclusion-exclusionend-of-chapter material9 relations9.1 relations and their properties9.2 n-ary relations and theirapplications9.3 representing relations9.4 closures of relations9.5 equivalence relations9.6 partial orderingsend-of-chapter material10 graphs10 .1 graphs andgraphmodels10.2 graph terminology and special types of graphs10.3 representing graphs and graph isomorphism10.4 connectivity10.5 eulerandhamiltonpaths10.6 shortest. pathproblems10.7 planargraphs10.8 graphcoloringend-of-chapter material11 trees11.1 introduction to trees11.2 applications of trees11.3 tree travcrsal11.4 spanning trees11.5 minimum spanning treesend-of-chapter material12 boolean algea12.1 boolean functions12.2 representing boolean functions12.3 logic gates12.4 minimization of circuitsend-of-chapter material13 modeling cornputation13.1 languagesand grammars13.2 finite-state machines with output13.3 finite-state machines with no output13.4 languagerecognition13.5 turing machinesend-of-chapter the materialappendixes1 axioms for the real numbers and the positiveintegers2 exponenti. Codice articolo EJ011797
Quantità: 1 disponibili