Applied Combinatorics读书介绍
| 类别 | 页数 | 译者 | 网友评分 | 年代 | 出版社 |
|---|---|---|---|---|---|
| 书籍 | 464页 | 2020 | Wiley |
| 定价 | 出版日期 | 最近访问 | 访问指数 |
|---|---|---|---|
| $ 177.41 | 2020-02-20 … | 2020-03-08 … | 47 |
This book is designed for use by students with a wide range of ability and maturity. The stronger the students, the harder the exercises that can be assigned. The book can be used for one--quarter, two--quarter, or one--semester course depending on how much material is used. Combinatorical reasoning underlies all analysis of computer systems. It plays a similar role in discrete operations research problems and in finite probability. This book teaches students in the mathematical sciences how to reason and model combinatorically. It seeks to develop proficiency in basic discrete math problem solving in the way that a calculus textbook develops proficiency in basic analysis problem solving. The three principle aspects of combinatorical reasoning emphasized in this book are: the systematic analysis of different possibilities, the exploration of the logical structure of a problem (e.g. finding manageable subpieces or first solving the problem with three objects instead of n), and ingenuity. Although important uses of combinatorics in computer science, operations research, and finite probability are mentioned, these applications are often used solely for motivation. Numerical examples involving the same concepts use more interesting settings such as poker probabilities or logical games.
作者简介Alan Tucker美国著名数学家和数学教育家。曾任美国数学协会(MAA)第一副主席。纽约州立大学石溪分校应用数学系教授，曾任斯坦福大学客座教授。1969年获斯坦福大学数学博士学位，师从线性规划之父Danzig。他出身数学世家，父亲和祖父都曾担任美国数学协会的主席。父亲Albert Tucker也是著名数学家，提出了囚徒困境和Kuhn-Tucker条件，培养了纳什和明斯基等大家。
剧情呢，免费看分享剧情、挑选影视作品、精选好书简介分享。