Results (1 - 4) of 4

Show results for

Product Type

  • All Product Types
  • Books (4)
  • Magazines & Periodicals
  • Comics
  • Sheet Music
  • Art, Prints & Posters
  • Photographs
  • Maps
  • Manuscripts &
    Paper Collectibles

Refine by

Condition

Binding

Collectible Attributes

Free Shipping

Seller Location

  • All Locations

Seller Rating

MEI ) LUO SEN ZHU

ISBN 10: 7111385500 ISBN 13: 9787111385509

New paperback

Quantity Available: 1

From: liu xing (JiangSu, JS, China)

Seller Rating: 5-star rating

Add Book to Shopping Basket
Price: US$ 100.34
Convert Currency
Shipping: FREE
From China to U.S.A.

Destination, Rates & Speeds

About this Item: paperback. Condition: New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Paperback. Pub Date :2012-09-01 Publisher: Machinery Industry Press title: Discrete Mathematics and Its Applications - (English 7th Edition) List Price: $ 99: (U.S.) Rosen book Press: Machinery Industry Publishing Date :2012-9-1ISBN: 9787111385509 Words: Page: Revision: 1 Binding: Paperback: 16 product dimensions and weight: Editor's Choice Summary Discrete Mathematics and Its Applications (English version 7 ) is a classic textbook introduces the theory and methods of discrete mathematics. has become discrete mathematics textbook adoption rate of the highest. many schools used as teaching materials. received a great deal of 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. Directory the preface ivabout theauthor xiiithe companion website xivto the studentxvilist of 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. Seller Inventory # FU020634

More Information About This Seller | Contact this Seller 1.

BEN SHE

ISBN 10: 7111385500 ISBN 13: 9787111385509

New paperback

Quantity Available: 1

From: liu xing (JiangSu, JS, China)

Seller Rating: 5-star rating

Add Book to Shopping Basket
Price: US$ 125.75
Convert Currency
Shipping: FREE
From China to U.S.A.

Destination, Rates & Speeds

About this Item: paperback. Condition: 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. Seller Inventory # EJ011797

More Information About This Seller | Contact this Seller 2.

MEI ) LUO SEN

ISBN 10: 7111385500 ISBN 13: 9787111385509

New paperback

Quantity Available: 1

From: liu xing (JiangSu, JS, China)

Seller Rating: 5-star rating

Add Book to Shopping Basket
Price: US$ 125.75
Convert Currency
Shipping: FREE
From China to U.S.A.

Destination, Rates & Speeds

About this Item: paperback. Condition: New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Paperback. Pub Date: 2012 Pages: 944 Language: English Publisher: China Machine Press Discrete Mathematics and Its Applications (English) (7) is to introduce the classic textbook of the of discrete mathematical theory and methods. has become The highest rate of adoption of discrete mathematics textbooks. many U.S. schools as a textbook. and get a great deal of success. Discrete Mathematics and Its Applications (English version) (7th Edition) Chinese version has been domestic universities is widely adopted as the textbook. 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. Discrete Mathematics and Its Applications (English) (7th Edition) can be used as a two semester discrete mathematics course materials. suitable for students of mathematics. computer science. computer engineering. information technology and other professional. Contents: preface iv about theauthor xiii the companion website xiv to the studentxvi list of symbols xix 1 the foundations: logic and proofs 1.1 propositional logic 1.2 applications of propositional logic 1.3 propositional equivalences 1.4 predicates andquantifiers 1.5 nested quantifiers 1.6 rules of inference 1.7 introduction to proofs 1.8 proofmethods and strategy end-of-chaptermaterial-2 basic structures: sets. functions. sequences. sums. and matrices 2.1 sets 2.2 set operations 2.3 functions .2.4 sequences and summations 2.5 cardinality of sets 2.6 matrices end-of-chaptermaterial 3 algorithms 3.1 algorithms 3.2 the growth of functions 3.3 complexity of algofithms end-of-chapter material 4 number theory and cryptography 4.1 divisibilitv andmodular arithmetic 4.2 integer representations andalgorithms 4.3 primesand greatest common divisors 4.4 solving congruences 4.5 applications of congruences 4.6 cryptography end-of-chapter material 5 induction and recursion 5.1 mathematical induction 5.2 strong induction and well-ordering 5.3 recursive definitions and structural induction 5.4 recursive algorithms 5.5 program correctness end-of-chapter material 6 counting 6.1 tlle basics of counting 6.2 the pigeonhole principle 6.3 permutations and combinations 6.4 binomial coefficients and identities 6.5 generalized permutations and combinations 6.6 generating permutations and combinations end-of-chapter material 7 discrete probability 7.1 an introduction to discrete probability 7.2 probability theory 7.3 bayes'theorem 7.4 expected value and variance end-of-chapter material 8 advanced counring technigues 8.1 applications of recurrence relations 8.2 solving linear recurrence relations 8.3 divide-and-conquer algorithms and recurrence relations 8.4 generating functions 8.5 inclusion-exclusion 8.6 applications of inclusion-exclusion end-of-chapter material 9 relations 9.1 relations and their properties 9.2 n-ary relations and theirapplications 9.3 representing relations 9.4 closures of relations 9.5 equivalence relations 9.6 partial orderings end-of-chapter material 10 graphs 10.1 graphs andgraphmodels 10.2 graph terminology and special types of graphs 10.3 representing graphs and graph isomorphism 10.4 connectivity 10.5 eulerandhamiltonpaths 10.6 shortest.pathproblems 10.7 planargraphs 10.8 graphcoloring end-of-chapter material 11 trees 11.1 introduction to trees 11.2 applications of trees 11.3 tree travcrsal 11.4 spanning trees 11.5 minimum spanning trees end-of-chapter material 12 boolean algea 12.1 boolean functions 12.2 representing boolean functions 12.3 logic gates 12.4 minimization of circuits end-of-chapter material 13 modeling cornputation 13.1 languagesand grammars 13.2 finite-state machines with output 13.3 finite-state machines with no output 13.4 languagerecognition 13.5 turing machines end-of-chapter material appendixes 1 axioms for the real numbers and the positive integers 2 exponen. Seller Inventory # NE030726

More Information About This Seller | Contact this Seller 3.

Kenneth H.Rosen

Published by Machinery Industry Press (2012)

ISBN 10: 7111385500 ISBN 13: 9787111385509

New Soft cover

Quantity Available: 1

From: CHINASCIBOOK (Beijing, BJ, China)

Seller Rating: 3-star rating

Add Book to Shopping Basket
Price: US$ 120.00
Convert Currency
Shipping: US$ 9.00
From China to U.S.A.

Destination, Rates & Speeds

About this Item: Machinery Industry Press, 2012. Soft cover. Condition: New. 5th or later Edition. 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. Seller Inventory # 101630

More Information About This Seller | Contact this Seller 4.

Results (1 - 4) of 4