《离散数学及其应用》电子书下载

离散数学及其应用txt,chm,pdf,epub,mobi下载
作者: 罗森
出版社: 机械工业出版社
副标题: 离散数学及其应用（第六版英文版）
原作名: Discrete Mathematics and Its Applications
出版年: 2008-5
页数: 843
定价: 89.00元
ISBN: 9787111239352

内容简介 · · · · · ·

《离散数学及其应用(英文版)(第6版)》是介绍离散数学理论和方法的经典教材,已经成为采用率最高的离散数学教材,仅在美国就被600多所高校用作教材,获得了极大的成功。中文版也已被国内大学广泛采用为教材。第6版在前五版的基础上做了大量的改进,使其成为更有效的教学工具。《离散数学及其应用(英文版)(第6版)》可作为1至2个学期的离散数学课入门教材。

作者简介 · · · · · ·

Kenneth H．Rosen 1972年获密歇根大学数学学士学位,1976年获麻省理工学院数学博士学位,1982年加入贝尔实验室,现为AT＆T实验室特别成员,国际知名的计算机数学专家,除本书外,还著有《初等数论及其应用》等书。

目录 · · · · · ·

Preface fiiAbout the Author xivTo the Student xvLIST OF SYMBOLS xviii1 The Foundations: Logic and Proofs1.1 Propositional Logic1.2 Propositional Equivalences1.3 Predicates and Quantifiers1.4 Nested Quantifiers1.5 Rules oflnference1.6 Introduction to Proofs1.7 Proof Methods and Strategy End-of-Chapter Material 2 Basic Structures: Sets, Functions, Sequences, and Sums2.1 Sets2.2 Set Operations2.3 Functions2.4 Sequences and Summations End-of-Chapter Material3 The Fundamentals: Algorithms, the Integers, and Matrices3.1 Algorithms3.2 The Growth of Functions3.3 Complexity of Algorithms3.4 The Integers and Division3.5 Primes and Greatest Common Divisors3.6 Integers and Algorithms3.7 Applications of Number Theory3.8 Matrices End-of-Chapter Material4 Induction and Recursion4.1 Mathematical Induction4.2 Strong Induction and Well-Ordering4.3 Recursive Definitions and Structural Induction4.4 Recursive Algorithms4.5 Program Correctness End-of-Chapter Material5 Counting5.1 The Basics of Counting5.2 The Pigeonhole Principle5.3 Permutations and Combinations5.4 Binomial Coefficients5.5 Generalized Permutations and Combinations5.6 Generating Permutations and Combinations End-of-Chapter Material6 Discrete Probability6.1 An Introduction to Discrete Probability6.2 Probability Theory6.3 Bayes' Theorem6.4 Expected Value and Variance End-of-Chapter Material7 Advanced Counting Techniques7.1 Recurrence Relations7.2 Solving Linear Recurrence Relations7.3 Divide-and-Conquer Algorithms and Recurrence Relations7.4 Generating Functions7.5 Inclusion-Exclusion7.6 Applications of Inclusion-Exclusion End-of-Chapter Material8 Relations8.1 Relations and Their Properties8.2 n-ary Relations and Their Applications8.3 Representing Relations8.4 Closures of Relations8.5 Equivalence Relations8.6 Partial Orderings End-of-Chapter Material9 Graphs9.1 Graphs and Graph Models9.2 Graph Terminology and Special Types of Graphs9.3 Representing Graphs and Graph Isomorphism9.4 Connectivity9.5 Euler and Hamilton Paths9.6 Shortest-Path Problems9.7 Planar Graphs9.8 Graph Coloring End-of-Chapter Material10 Trees10.1 Introduction to Trees10.2 Applications of Trees10.3 Tree Traversal10.4 Spanning Trees10.5 Minimum Spanning Trees End-of-Chapter Material11 Boolean Algebra11.1 Boolean Functions11.2 Representing Boolean Functions11.3 Logic Gates11.4 Minimization of Circuits End-of-Chapter Material12 Modeling Computation12.1 Languages and Grammars12.2 Finite-State Machines with Output12.3 Finite-State Machines with No Output12.4 Language Recognition12.5 Turing Machines End-of-Chapter Material AppendixesA-1 Axioms for the Real Numbers and the Positive IntegersA-2 Exponential and Logarithmic FunctionsA-3 PseudocodeSuggested Readings B-1Answers to Odd-Numbered Exercises @ S-1Index of Biographies I-1Index I-2

Preface fiiAbout the Author xivTo the Student xvLIST OF SYMBOLS xviii1 The Foundations: Logic and Proofs1.1 Propositional Logic1.2 Propositional Equivalences1.3 Predicates and Quantifiers1.4 Nested Quantifiers1.5 Rules oflnference1.6 Introduction to Proofs1.7 Proof Methods and Strategy End-of-Chapter Material 2 Basic Structures: Sets, Functions, Sequences, and Sums2.1 Sets2.2 Set Operations2.3 Functions2.4 Sequences and Summations End-of-Chapter Material3 The Fundamentals: Algorithms, the Integers, and Matrices3.1 Algorithms3.2 The Growth of Functions3.3 Complexity of Algorithms3.4 The Integers and Division3.5 Primes and Greatest Common Divisors3.6 Integers and Algorithms3.7 Applications of Number Theory3.8 Matrices End-of-Chapter Material4 Induction and Recursion4.1 Mathematical Induction4.2 Strong Induction and Well-Ordering4.3 Recursive Definitions and Structural Induction4.4 Recursive Algorithms4.5 Program Correctness End-of-Chapter Material5 Counting5.1 The Basics of Counting5.2 The Pigeonhole Principle5.3 Permutations and Combinations5.4 Binomial Coefficients5.5 Generalized Permutations and Combinations5.6 Generating Permutations and Combinations End-of-Chapter Material6 Discrete Probability6.1 An Introduction to Discrete Probability6.2 Probability Theory6.3 Bayes' Theorem6.4 Expected Value and Variance End-of-Chapter Material7 Advanced Counting Techniques7.1 Recurrence Relations7.2 Solving Linear Recurrence Relations7.3 Divide-and-Conquer Algorithms and Recurrence Relations7.4 Generating Functions7.5 Inclusion-Exclusion7.6 Applications of Inclusion-Exclusion End-of-Chapter Material8 Relations8.1 Relations and Their Properties8.2 n-ary Relations and Their Applications8.3 Representing Relations8.4 Closures of Relations8.5 Equivalence Relations8.6 Partial Orderings End-of-Chapter Material9 Graphs9.1 Graphs and Graph Models9.2 Graph Terminology and Special Types of Graphs9.3 Representing Graphs and Graph Isomorphism9.4 Connectivity9.5 Euler and Hamilton Paths9.6 Shortest-Path Problems9.7 Planar Graphs9.8 Graph Coloring End-of-Chapter Material10 Trees10.1 Introduction to Trees10.2 Applications of Trees10.3 Tree Traversal10.4 Spanning Trees10.5 Minimum Spanning Trees End-of-Chapter Material11 Boolean Algebra11.1 Boolean Functions11.2 Representing Boolean Functions11.3 Logic Gates11.4 Minimization of Circuits End-of-Chapter Material12 Modeling Computation12.1 Languages and Grammars12.2 Finite-State Machines with Output12.3 Finite-State Machines with No Output12.4 Language Recognition12.5 Turing Machines End-of-Chapter Material AppendixesA-1 Axioms for the Real Numbers and the Positive IntegersA-2 Exponential and Logarithmic FunctionsA-3 PseudocodeSuggested Readings B-1Answers to Odd-Numbered Exercises @ S-1Index of Biographies I-1Index I-2
· · · · · · ()

下载地址

发布者：皇之寂寞

文件说明：zip / 解压密码:electro-lviv.com

迅雷下载：您需要先登录后,才能查看

网盘下载：您需要先登录后,才能查看

关于内容：内容自于互联网,如果发现有违规内容请联系管理员删除！