注冊 | 登錄讀書好,好讀書,讀好書!
讀書網(wǎng)-DuShu.com
當(dāng)前位置: 首頁出版圖書科學(xué)技術(shù)自然科學(xué)數(shù)學(xué)離散數(shù)學(xué)及其應(yīng)用(英文版·第6版)

離散數(shù)學(xué)及其應(yīng)用(英文版·第6版)

離散數(shù)學(xué)及其應(yīng)用(英文版·第6版)

定 價:¥89.00

作 者: (美)羅森
出版社: 機(jī)械工業(yè)出版社
叢編項: 經(jīng)典原版書庫
標(biāo) 簽: 組合理論

ISBN: 9787111239352 出版時間: 2008-01-01 包裝: 平裝
開本: 16 頁數(shù): 1206 字?jǐn)?shù):  

內(nèi)容簡介

  《離散數(shù)學(xué)及其應(yīng)用(英文版)(第6版)》是介紹離散數(shù)學(xué)理論和方法的經(jīng)典教材,已經(jīng)成為采用率最高的離散數(shù)學(xué)教材,僅在美國就被600多所高校用作教材,獲得了極大的成功。中文版也已被國內(nèi)大學(xué)廣泛采用為教材。第6版在前五版的基礎(chǔ)上做了大量的改進(jìn),使其成為更有效的教學(xué)工具?!峨x散數(shù)學(xué)及其應(yīng)用(英文版)(第6版)》可作為1至2個學(xué)期的離散數(shù)學(xué)課入門教材。

作者簡介

  羅森(Rosen K.H.),美國,密歇根大學(xué)數(shù)學(xué)學(xué)士,麻省理工學(xué)院數(shù)學(xué)博士。曾就職于科羅拉多大學(xué)、俄亥俄州立大學(xué)、緬因大學(xué),后加盟貝爾實驗室,現(xiàn)為AT&T實驗室特別成員。除本書外,他還著有《初等數(shù)論及其應(yīng)用》等書,并擔(dān)任CRC離散數(shù)學(xué)叢書的主編。

圖書目錄

Preface
About the Author
To the Student
LIST OF SYMBOLS
1 The Foundations: Logic and Proofs
1.1 Propositional Logic
1.2 Propositional Equivalences
1.3 Predicates and Quantifiers
1.4 Nested Quantifiers
1.5 Rules oflnference
1.6 Introduction to Proofs
1.7 Proof Methods and Strategy End-of-Chapter Material
2 Basic Structures: Sets, Functions, Sequences, and Sums
2.1 Sets
2.2 Set Operations
2.3 Functions
2.4 Sequences and Summations End-of-Chapter Material
3 The Fundamentals: Algorithms, the Integers, and Matrices
3.1 Algorithms
3.2 The Growth of Functions
3.3 Complexity of Algorithms
3.4 The Integers and Division
3.5 Primes and Greatest Common Divisors
3.6 Integers and Algorithms
3.7 Applications of Number Theory
3.8 Matrices End-of-Chapter Material
4 Induction and Recursion
4.1 Mathematical Induction
4.2 Strong Induction and Well-Ordering
4.3 Recursive Definitions and Structural Induction
4.4 Recursive Algorithms
4.5 Program Correctness End-of-Chapter Material
5 Counting
5.1 The Basics of Counting
5.2 The Pigeonhole Principle
5.3 Permutations and Combinations
5.4 Binomial Coefficients
5.5 Generalized Permutations and Combinations
5.6 Generating Permutations and Combinations End-of-Chapter Material
6 Discrete Probability
6.1 An Introduction to Discrete Probability
6.2 Probability Theory
6.3 Bayes Theorem
6.4 Expected Value and Variance End-of-Chapter Material
7 Advanced Counting Techniques
7.1 Recurrence Relations
7.2 Solving Linear Recurrence Relations
7.3 Divide-and-Conquer Algorithms and Recurrence Relations
7.4 Generating Functions
7.5 Inclusion-Exclusion
7.6 Applications of Inclusion-Exclusion End-of-Chapter Material
8 Relations
8.1 Relations and Their Properties
8.2 n-ary Relations and Their Applications
8.3 Representing Relations
8.4 Closures of Relations
8.5 Equivalence Relations
8.6 Partial Orderings End-of-Chapter Material
9 Graphs
9.1 Graphs and Graph Models
9.2 Graph Terminology and Special Types of Graphs
9.3 Representing Graphs and Graph Isomorphism
9.4 Connectivity
9.5 Euler and Hamilton Paths
9.6 Shortest-Path Problems
9.7 Planar Graphs
9.8 Graph Coloring End-of-Chapter Material
10 Trees
11 Boolean Algebra
12 Modeling Computation
Appendixes
Suggested Readings B-1
Answers to Odd-Numbered Exercises @ S-1
Index of Biographies I-1
Index I-2

本目錄推薦

掃描二維碼
Copyright ? 讀書網(wǎng) m.ranfinancial.com 2005-2020, All Rights Reserved.
鄂ICP備15019699號 鄂公網(wǎng)安備 42010302001612號