Discrete Algorithmic MathematicsCRC Press, 21 de jan. de 2005 - 803 páginas Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. It has been updated with new or extended discussions of order notation, generating functions, chaos, aspects of statistics, and computational biology. Written in a lively, clear style that talks to th |
Conteúdo
| 1 | |
| 9 | |
Algorithms | 73 |
Mathematical Induction | 135 |
Graphs and Trees | 217 |
Fundamental Counting Methods | 321 |
Difference Equations | 411 |
Probability | 513 |
An Introduction to Mathematical Logic | 611 |
Coming Full Circle with Biology and Minimax Theorems | 691 |
Final Problems | 717 |
References | 723 |
Limits | 729 |
Hints and Answers | 733 |
About the Authors | 761 |
Outras edições - Ver todos
Discrete Algorithmic Mathematics, Third Edition Stephen B. Maurer,Anthony Ralston Visualização parcial - 2005 |
Discrete Algorithmic Mathematics, Third Edition Stephen B. Maurer,Anthony Ralston Prévia não disponível - 2005 |
Discrete Algorithmic Mathematics, Third Edition Stephen B. Maurer,Anthony Ralston Prévia não disponível - 2005 |
Termos e frases comuns
adjacency matrix alignment answer argument assertion assume atoms balls binary binary tree binomial Boolean algebra called Chapter codomain coefficient color column compute Consider correct count defined definition denom difference equation digits digraph discrete discrete mathematics distribution edges endfor endif endrepeat EUCLID Eulerian cycle Example expression factors FIGURE formula function give graph inductive step Input instance integers iterative Karnaugh map length linear loop invariant main algorithm mathematical induction mathematics matrix method multiplication nodes nonnegative notation output pair permutation pick player pole polynomial positive integer Pr(A predicate probability problem procedure proof propositional calculus prove random variable real numbers recursive result rules sample space Section sequence shortest path solution solve spanning tree statement subset Suppose Theorem tion true truth table urns vertex vertices wins words write