图书介绍

离散数学及其应用 英文精编版pdf电子书版本下载

离散数学及其应用  英文精编版
  • (美)罗森著 著
  • 出版社: 北京:机械工业出版社
  • ISBN:9787111313298
  • 出版时间:2010
  • 标注页数:441页
  • 文件大小:211MB
  • 文件页数:463页
  • 主题词:离散数学-英文

PDF下载


点此进入-本书在线PDF格式电子书下载【推荐-云解压-方便快捷】直接下载PDF格式图书。移动端-PC端通用
种子下载[BT下载速度快] 温馨提示:(请使用BT下载软件FDM进行下载)软件下载地址页 直链下载[便捷但速度慢]   [在线试读本书]   [在线获取解压码]

下载说明

离散数学及其应用 英文精编版PDF格式电子书版下载

下载的文件为RAR压缩包。需要使用解压软件进行解压得到PDF格式图书。

建议使用BT下载工具Free Download Manager进行下载,简称FDM(免费,没有广告,支持多平台)。本站资源全部打包为BT种子。所以需要使用专业的BT下载软件进行下载。如 BitComet qBittorrent uTorrent等BT下载工具。迅雷目前由于本站不是热门资源。不推荐使用!后期资源热门了。安装了迅雷也可以迅雷进行下载!

(文件页数 要大于 标注页数,上中下等多册电子书除外)

注意:本站所有压缩包均有解压码: 点击下载压缩包解压工具

图书目录

Chapter 1 The Foundations:Logic and Proofs 1

1.1 Propositional Logic 1

1.2 Propositional Equivalences 16

1.3 Predicates and Quantifiers 24

1.4 Nested Quantifiers 40

1.5 Rules of Inference 49

1.6 Introduction to Proofs 59

1.7 Proof Methods and Strategy 69

End-of-Chapter Material 84

Chapter 2 Basic Structures:Sets,Functions,Sequences,and Sums 91

2.1 Sets 91

2.2 Set Operations 98

2.3 Functions 107

2.4 Sequences and Summations 120

End-of-Chapter Material 131

Chapter 3 Counting 137

3.1 The Basics of Counting 137

3.2 The Pigeonhole Principle 147

3.3 Permutations and Combinations 153

3.4 Binomial Coefficients 159

3.5 Generalized Permutations and Combinations 166

3.6 Generating Permutations and Combinations 175

End-of-Chapter Material 179

Chapter 4 Advanced Counting Techniques 187

4.1 Recurrence Relations 187

4.2 Solving Linear Recurrence Relations 196

4.3 Divide-and-Conquer Algorithms and Recurrence Relations 207

4.4 Generating Functions 215

4.5 Inclusion-Exclusion 227

4.6 Applications of Inclusion-Exclusion 233

End-of-Chapter Material 239

Chapter 5 Relations 246

5.1 Relations and Their Properties 246

5.2 n-ary Relations and Their Applications 254

5.3 Representing Relations 260

5.4 Closures of Relations 266

5.5 Equivalence Relations 275

5.6 Partial Orderings 283

End-of-Chapter Material 296

Chapter 6 Graphs 304

6.1 Graphs and Graph Models 304

6.2 Graph Terminology and Special Types of Graphs 312

6.3 Representing Graphs and Graph Isomorphism 323

6.4 Connectivity 332

6.5 Euler and Hamilton Paths 340

6.6 Shortest-Path Problems 351

6.7 Planar Graphs 360

6.8 Graph Coloring 367

End-of-Chapter Material 374

Chapter 7 Trees 384

7.1 Introduction to Trees 384

7.2 Applications of Trees 394

7.3 Tree Traversal 407

7.4 Spanning Trees 418

7.5 Minimum Spanning Trees 430

End-of-Chapter Material 435

精品推荐