相關商品
商品簡介
作者簡介
目次
商品簡介
《離散數學結構(第6版)(影印版)》先后改進五版，歷經25年，受到廣泛認可，這使我們感到非常欣慰。同樣欣喜的是《離散數學結構(第6版)(影印版)》前五版所選的內容及解題方法也被廣泛肯定。例如，最近協會和其他機構都大力推薦該書作為離散結構的一學期的課程。在該版籌劃前，我們充分考慮了來自教師和學生的眾多建議和意見以改進《離散數學結構(第6版)(影印版)》的內容和材料。盡管該版做了改進并完善了很多，但是我們的目標依然同前五版一樣：以一種簡明的、學生能夠理解的方式來介紹離散數學的基本概念及其某些應用。
作者簡介
作者：（美國）科曼（Bernard Kolman） （美國）巴斯比（Robert C.Busby） （美國）羅斯（Sharon Cutler Ross）
目次
preface xvii
a word to students xxi
fundamentals 1
1.1 sets and subsets 2
1.2 operations on sets 5
1.3 sequences 131.4 properties of integers 20
1.5 matrices 32
1.6 mathematical structures 41
2 logic 50
2.1 propositions and logical operations 51
2.2 conditional statements 57
2.3 methods of proof 62
2.4 mathematical induction 68
2.5 mathematical statements 75
2.6 logic and problem solving 78
3 counting 91
3.1 permutations 92
3.2 combinations 96
3.3 pigeonhole principle 100
3.4 elements of probability 104
3.5 recurrence relations 112
4 relations and digraphs 122
4.1 product sets and partitions 123
4.2 relations and digraphs 127
4.3 paths in relations and digraphs 135
4.4 properties of relations 141
4.5 equivalence relations 148
4.6 data structures for relations and digraphs 152
4.7 operations on relations 159
4.8 transitive closure and warshalls algorithm 169
5 functions 180
5.1 functions 181
5.2 functions for computer science 190
5.3 growth of functions 200
5.4 permutation functions 205
6 order relations and structures 217
6.1 partially ordered sets 218
6.2 extremal elements of partially ordered sets 228
6.3 lattices 233
6.4 finite boolean algebras 243
6.5 functions on boolean algebras 250
6.6 circuit design 254
7 trees 270
7.1 trees 271
7.2 labeled trees 275
7.3 tree searching 280
7.4 undirected trees 288
7.5 minimal spanning trees 295
8 topics in graph theory 305
8.1 graphs 306
8.2 euler paths and circuits 311
8.3 hamiltonian paths and circuits 318
8.4 transport networks 321
8.5 matching problems 329
8.6 coloring graphs 334
9 semigroups and groups 344
9.1 binary operations revisited 345
9.2 semigroups 349
9.3 products and quotients of semigroups 356
9.4 groups 362
9.5 products and quotients of groups 372
9.6 other mathematical structures 377
10 languages and finite-state machines 386
10.1 languages 387
10.2 representations of special grammars and languages 394
10.3 finite-state machines 403
10.4 monoids, machines, and languages 409
10.5 machines and regular languages 414
10.6 simplification of machines 420
11 groups and coding 429
11.1 coding of binary information and error detection 430
11.2 decoding and error correction 440
11.3 public key cryptology 449
appendix a: algorithms and pseudocode 455
appendix b: additional experiments in discrete mathematics 467
appendix c: coding exercises 473
answers to odd-numbered exercises 477
answers to chapter self-tests 515
glossary g-1
index i-1
photo credits p- 1
a word to students xxi
fundamentals 1
1.1 sets and subsets 2
1.2 operations on sets 5
1.3 sequences 131.4 properties of integers 20
1.5 matrices 32
1.6 mathematical structures 41
2 logic 50
2.1 propositions and logical operations 51
2.2 conditional statements 57
2.3 methods of proof 62
2.4 mathematical induction 68
2.5 mathematical statements 75
2.6 logic and problem solving 78
3 counting 91
3.1 permutations 92
3.2 combinations 96
3.3 pigeonhole principle 100
3.4 elements of probability 104
3.5 recurrence relations 112
4 relations and digraphs 122
4.1 product sets and partitions 123
4.2 relations and digraphs 127
4.3 paths in relations and digraphs 135
4.4 properties of relations 141
4.5 equivalence relations 148
4.6 data structures for relations and digraphs 152
4.7 operations on relations 159
4.8 transitive closure and warshalls algorithm 169
5 functions 180
5.1 functions 181
5.2 functions for computer science 190
5.3 growth of functions 200
5.4 permutation functions 205
6 order relations and structures 217
6.1 partially ordered sets 218
6.2 extremal elements of partially ordered sets 228
6.3 lattices 233
6.4 finite boolean algebras 243
6.5 functions on boolean algebras 250
6.6 circuit design 254
7 trees 270
7.1 trees 271
7.2 labeled trees 275
7.3 tree searching 280
7.4 undirected trees 288
7.5 minimal spanning trees 295
8 topics in graph theory 305
8.1 graphs 306
8.2 euler paths and circuits 311
8.3 hamiltonian paths and circuits 318
8.4 transport networks 321
8.5 matching problems 329
8.6 coloring graphs 334
9 semigroups and groups 344
9.1 binary operations revisited 345
9.2 semigroups 349
9.3 products and quotients of semigroups 356
9.4 groups 362
9.5 products and quotients of groups 372
9.6 other mathematical structures 377
10 languages and finite-state machines 386
10.1 languages 387
10.2 representations of special grammars and languages 394
10.3 finite-state machines 403
10.4 monoids, machines, and languages 409
10.5 machines and regular languages 414
10.6 simplification of machines 420
11 groups and coding 429
11.1 coding of binary information and error detection 430
11.2 decoding and error correction 440
11.3 public key cryptology 449
appendix a: algorithms and pseudocode 455
appendix b: additional experiments in discrete mathematics 467
appendix c: coding exercises 473
answers to odd-numbered exercises 477
answers to chapter self-tests 515
glossary g-1
index i-1
photo credits p- 1
您曾經瀏覽過的商品
購物須知
大陸出版品因裝訂品質及貨運條件與台灣出版品落差甚大，除封面破損、內頁脫落等較嚴重的狀態，其餘商品將正常出貨。
特別提醒：部分書籍附贈之內容(如音頻mp3或影片dvd等)已無實體光碟提供，需以QR CODE 連結至當地網站註冊“並通過驗證程序”，方可下載使用。
無現貨庫存之簡體書，將向海外調貨：
海外有庫存之書籍，等候約45個工作天;
海外無庫存之書籍，平均作業時間約60個工作天，然不保證確定可調到貨，尚請見諒。
為了保護您的權益，「三民網路書店」提供會員七日商品鑑賞期(收到商品為起始日)。
若要辦理退貨，請在商品鑑賞期內寄回，且商品必須是全新狀態與完整包裝(商品、附件、發票、隨貨贈品等)否則恕不接受退貨。