离散数学及其应用：英文版，第4版

　　点此进入淘宝搜索页搜索

　　特别声明：本站仅为商品信息简介，并不出售商品，您可点击文中链接进入淘宝网搜索页搜索该商品，有任何问题请与具体淘宝商家联系。

　　參考價格: 点此进入淘宝搜索页搜索
　　分類: 图书,自然科学,数学,代数数论组合理论,

作者：（美）罗森著

出版社：机械工业出版社

出版时间： 1999-6-1字数：版次： 1版1次页数： 678印刷时间：开本：印次：纸张：I S B N ： 9787111072546包装：平装目录

Preface ix

The companion web site xix

To the student xxi

PRAT 1The foundations : logic , sets , and function

1.Logic

2.Propositional equivalences

3.Predicates and quantifiers

4.Sets

5.Set operations

6.Functions

7.Sequences and summations

8.The growth of functions

PART 2The fundamentals : algorithms , the integers , and matrices

1.Algorithms

2.Complexity of algorithms

3.The integers and division

4.Integers and algorithms

5.Applications of number theory

6.Matrices

PART 3Mathematical reasoning

1.Methods of proof

2.Mathematical induction

3.Recursive definitions

4.Recursive algorithms

5.Program correctness

PART 4Counting

1.The basics of counting

2.The pigeonhole principle

3.Permutations and combinations

4.Discrete probability

5.Probability theory

6.Generalized permutations and combinations

7.Generating permutations and combinations

PART 5Advanced counting techniques

1.Recurrence relations

2.Solving recurrence relations

3.Divide-and-conquer relations

4.Generating functions

5.Inclusion-Exclusion

6.Applications of inclusion-exclusion

PART 6Relations

1.Relations and their properties

2.n-ary relations and their applications

3.Representing relations

4.Closures of relations

5.Equivalence relations

6.Partial orderings

PART 7Graphs

1.Introduction to graphs

2.Graph terminology

3.Representing graphs and graph isomorphism

4.Connectivity

5.Euler and Hamilton paths

6.Shortest path problems

7.Planar graphs

8.Graph coloring

PART 8Trees

1.Introduction to trees

2.Applications of trees

3.Tree traversal

4.Trees and sorting

5.Spanning trees

6.Minimum spanning trees

PART 9Boolean algebra

1.Boolean functions

2.Representing Boolean functions

3.Logic gates

4.Minimization of circuits

PART 10Modeling computation

1.Languages and grammars

2.Finite-state machines with output

3.Finite-state machines with no output

4.Language recognition

5.Turing machines

App