Discrete Mathematics

Aigner, Martin

American Mathematical Society（2007/10発売）

• 製本 Paperback:紙装版/ペーパーバック版／ページ数 388 p.
• 言語 ENG
• 商品コード 9781470470630

Full Description

The advent of fast computers and the search for efficient algorithms revolutionized combinatorics and brought about the field of discrete mathematics. This book is an introduction to the main ideas and results of discrete mathematics, and with its emphasis on algorithms it should be interesting to mathematicians and computer scientists alike. The book is organized into three parts: enumeration, graphs and algorithms, and algebraic systems. There are 600 exercises with hints and solutions to about half of them. The only prerequisites for understanding everything in the book are linear algebra and calculus at the undergraduate level.

Contents

Counting: Fundamentals
Summation
Generating functions
Counting patterns
Asymptotic analysis
Bibliography for Part 1
Graphs and algorithms: Graphs
Trees
Matchings and networks
Searching and sorting
General optimization methods
Bibliography for Part 2
Algebraic systems: Boolean algebras
Modular arithmetic
Coding
Cryptography
Linear optimization
Bibliography for Part 3
Solutions to selected exercises
Index