掃一掃
關(guān)注中圖網(wǎng)
官方微博
>
>
經(jīng)典原版書(shū)庫(kù)離散數(shù)學(xué)及其應(yīng)用(英文精編版 原書(shū)第8版)/(美)肯尼思 H.羅森
包郵 經(jīng)典原版書(shū)庫(kù)離散數(shù)學(xué)及其應(yīng)用(英文精編版 原書(shū)第8版)/(美)肯尼思 H.羅森
開(kāi)本：
16開(kāi)
頁(yè)數(shù)：
516
本類(lèi)榜單：教材銷(xiāo)量榜
本類(lèi)五星書(shū)更多>
-
>
闖進(jìn)數(shù)學(xué)世界――探秘歷史名題
-
>
中醫(yī)基礎(chǔ)理論
-
>
當(dāng)代中國(guó)政府與政治(新編21世紀(jì)公共管理系列教材)
-
>
高校軍事課教程
-
>
思想道德與法治(2021年版)
-
>
毛澤東思想和中國(guó)特色社會(huì)主義理論體系概論(2021年版)
-
>
中醫(yī)內(nèi)科學(xué)·全國(guó)中醫(yī)藥行業(yè)高等教育“十四五”規(guī)劃教材
中圖價(jià):¥69.3
加入購(gòu)物車(chē)
經(jīng)典原版書(shū)庫(kù)離散數(shù)學(xué)及其應(yīng)用(英文精編版 原書(shū)第8版)/(美)肯尼思 H.羅森 版權(quán)信息
- ISBN：9787111643029
- 條形碼：9787111643029 ; 978-7-111-64302-9
- 裝幀：平裝-膠訂
- 冊(cè)數(shù)：暫無(wú)
- 重量：暫無(wú)
- 所屬分類(lèi)：>
經(jīng)典原版書(shū)庫(kù)離散數(shù)學(xué)及其應(yīng)用(英文精編版 原書(shū)第8版)/(美)肯尼思 H.羅森 本書(shū)特色
本書(shū)是經(jīng)典的離散數(shù)學(xué)教材，被全球數(shù)百所大學(xué)廣為采用。英文精編版為滿足本科教學(xué)需求而縮減了篇幅，保留的主要內(nèi)容包括：邏輯和證明，集合、函數(shù)、序列、求和與矩陣，計(jì)數(shù)，關(guān)系，圖，樹(shù)，布爾代數(shù)。全書(shū)取材廣泛，除包括定義、定理的嚴(yán)格陳述外，還配備大量的例題、圖表、應(yīng)用實(shí)例和練習(xí)。第8版做了與時(shí)俱進(jìn)的更新，成為更加實(shí)用的教學(xué)工具。本書(shū)可作為高等院校數(shù)學(xué)、計(jì)算機(jī)科學(xué)和計(jì)算機(jī)工程等專(zhuān)業(yè)的教材，也可作為科技領(lǐng)域從業(yè)人員的參考書(shū)。
經(jīng)典原版書(shū)庫(kù)離散數(shù)學(xué)及其應(yīng)用(英文精編版 原書(shū)第8版)/(美)肯尼思 H.羅森 內(nèi)容簡(jiǎn)介
本書(shū)是介紹離散數(shù)學(xué)理論和方法的經(jīng)典教材，被優(yōu)選數(shù)百所高校采用，獲得了極大的成功。第8版做了與時(shí)俱進(jìn)的修改，同時(shí)更新了配套教輔資源，成為更加實(shí)用的教學(xué)工具。英文精編版為滿足本科教學(xué)需求而縮減了篇幅，適用于數(shù)學(xué)、計(jì)算機(jī)科學(xué)、計(jì)算機(jī)工程、信息技術(shù)等專(zhuān)業(yè)的學(xué)生。
本書(shū)特色
章節(jié)：保留了邏輯和證明、基本結(jié)構(gòu)、計(jì)數(shù)和不錯(cuò)計(jì)數(shù)、關(guān)系、圖、樹(shù)和布爾代數(shù)等內(nèi)容，刪除了算法、數(shù)論和密碼學(xué)、歸納與遞歸、離散概率、計(jì)算模型等內(nèi)容。
例題：共400多道例題，用于闡明概念、建立不同主題之間的關(guān)聯(lián)以及介紹實(shí)際應(yīng)用。
應(yīng)用：涉及的領(lǐng)域包括計(jì)算機(jī)科學(xué)、數(shù)據(jù)網(wǎng)絡(luò)、心理學(xué)、化學(xué)、工程學(xué)、語(yǔ)言學(xué)、生物學(xué)、商業(yè)和因特網(wǎng)等，展示了離散數(shù)學(xué)的實(shí)用性。
算法：每一章都介紹了一些關(guān)鍵算法，提供偽代碼，并簡(jiǎn)要分析其計(jì)算復(fù)雜度。
練習(xí)、復(fù)習(xí)題和補(bǔ)充練習(xí)：共有2000多道難度各異的練習(xí)題，可以滿足不同層次學(xué)生的需求。此外，還有一些研究性題目，幫助學(xué)生通過(guò)計(jì)算來(lái)探索新知識(shí)和新想法。
經(jīng)典原版書(shū)庫(kù)離散數(shù)學(xué)及其應(yīng)用(英文精編版 原書(shū)第8版)/(美)肯尼思 H.羅森 目錄
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)
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)
展開(kāi)全部
經(jīng)典原版書(shū)庫(kù)離散數(shù)學(xué)及其應(yīng)用(英文精編版 原書(shū)第8版)/(美)肯尼思 H.羅森 作者簡(jiǎn)介
肯尼思·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)用》均被翻譯成多種語(yǔ)言，在全球數(shù)百所大學(xué)中廣為采用。
書(shū)友推薦
- >
企鵝口袋書(shū)系列·偉大的思想20:論自然選擇(英漢雙語(yǔ))
- >
姑媽的寶刀
- >
伯納黛特,你要去哪(2021新版)
- >
詩(shī)經(jīng)-先民的歌唱
- >
大紅狗在馬戲團(tuán)-大紅狗克里弗-助人
- >
有舍有得是人生
- >
莉莉和章魚(yú)
- >
龍榆生：詞曲概論/大家小書(shū)
本類(lèi)暢銷(xiāo)
