離散數(shù)學(xué)及其應(yīng)用（英文精編版·原書第8版）

定　價(jià)：￥99.00

作　者：	[美] 肯尼思-H.羅森著
出版社：	機(jī)械工業(yè)出版社
叢編項(xiàng)：	經(jīng)典原版書庫
標(biāo)　簽：	暫缺

購買這本書可以去

京東 (￥99.00)

ISBN：	9787111643029	出版時(shí)間：	2019-12-01	包裝：	平裝
開本：	16開	頁數(shù)：	540	字?jǐn)?shù)：

內(nèi)容簡介

　　本書是經(jīng)典的離散數(shù)學(xué)教材，被全球數(shù)百所大學(xué)廣為采用。英文精編版為滿足本科教學(xué)需求而縮減了篇幅，保留的主要內(nèi)容包括：邏輯和證明，集合、函數(shù)、序列、求和與矩陣，計(jì)數(shù)，關(guān)系，圖，樹，布爾代數(shù)。全書取材廣泛，除包括定義、定理的嚴(yán)格陳述外，還配備大量的例題、圖表、應(yīng)用實(shí)例和練習(xí)。第8版做了與時(shí)俱進(jìn)的更新，成為更加實(shí)用的教學(xué)工具。本書可作為高等院校數(shù)學(xué)、計(jì)算機(jī)科學(xué)和計(jì)算機(jī)工程等專業(yè)的教材，也可作為科技領(lǐng)域從業(yè)人員的參考書。

作者簡介

　　肯尼思·H. 羅森（Kenneth H. Rosen）于1972年獲密歇根大學(xué)安娜堡分校數(shù)學(xué)學(xué)士學(xué)位，1976年獲麻省理工學(xué)院數(shù)學(xué)博士學(xué)位。Rosen曾就職于科羅拉多大學(xué)、俄亥俄州立大學(xué)、緬因大學(xué)和蒙茅斯大學(xué)，教授離散數(shù)學(xué)、算法設(shè)計(jì)和計(jì)算機(jī)安全方面的課程；他還曾加盟貝爾實(shí)驗(yàn)室，并且是AT&T貝爾實(shí)驗(yàn)室的杰出技術(shù)人員。他的著作《初等數(shù)論及其應(yīng)用》和《離散數(shù)學(xué)及其應(yīng)用》均被翻譯成多種語言，在全球數(shù)百所大學(xué)中廣為采用。

圖書目錄

The Adapter's Words
Preface
Online Resources
To the Student
About the Author
List of Symbols
1 The Foundations: Logic and Proofs 1
1.1　Propositional Logic 1
1.2　Applications of Propositional Logic 15
1.3　Propositional Equivalences 22
1.4　Predicates and Quantifiers 34
1.5　Nested Quantifiers 51
1.6　Rules of Inference 62
1.7　Introduction to Proofs 72
1.8　Proof Methods and Strategy 84
End-of-ChapterMaterial (Online)
2 Basic Structures: Sets, Functions, Sequences, Sums, and Matrices 101
2.1　Sets 101
2.2　Set Operations 111
2.3　Functions 124
2.4　Sequences and Summations 140
2.5　Cardinality of Sets 153
2.6　Matrices 161
End-of-ChapterMaterial (Online)
3 Counting 169
3.1　The Basics of Counting 169
3.2　The Pigeonhole Principle 182
3.3　Permutations and Combinations 189
3.4　Binomial Coefficients and Identities 197
3.5　Generalized Permutations and Combinations 204
3.6　Generating Permutations and Combinations 215
End-of-ChapterMaterial (Online)
4 Advanced Counting Techniques 221
4.1　Applications of Recurrence Relations 221
4.2　Solving Linear Recurrence Relations 232
4.3　Divide-and-Conquer Algorithms and Recurrence Relations 244
4.4　Generating Functions 253
4.5　Inclusion朎xclusion 268
4.6　Applications of Inclusion朎xclusion 273
End-of-ChapterMaterial (Online)
5 Relations 281
5.1　Relations and Their Properties 281
5.2　n-ary Relations and Their Applications 292
5.3　Representing Relations 302
5.4　Closures of Relations 308
5.5　Equivalence Relations 317
5.6　Partial Orderings 327
End-of-ChapterMaterial (Online)
6 Graphs 343
6.1　Graphs and Graph Models 343
6.2　Graph Terminology and Special Types of Graphs 354
6.3　Representing Graphs and Graph Isomorphism 371
6.4　Connectivity 380
6.5　Euler and Hamilton Paths 393
6.6　Shortest-Path Problems 405
6.7　Planar Graphs 415
6.8　Graph Coloring 423
End-of-ChapterMaterial (Online)
7 Trees 431
7.1　Introduction to Trees 431
7.2　Applications of Trees 442
7.3　Tree Traversal 456
7.4　Spanning Trees 468
7.5　Minimum Spanning Trees 481
End-of-ChapterMaterial (Online)
8 Boolean Algebra 487
8.1　Boolean Functions 487
8.2　Representing Boolean Functions 494
8.3　Logic Gates 497
8.4　Minimization of Circuits 503
End-of-ChapterMaterial (Online)
Suggested Readings (Online)
Answers to Odd-Numbered Exercises (Online)