Discrete mathematics
著者
書誌事項
Discrete mathematics
Clarendon Press , Oxford University Press, 1989
Rev. ed
- : pbk.
大学図書館所蔵 全46件
注記
Includes index
内容説明・目次
- 巻冊次
-
ISBN 9780198534266
内容説明
Using a traditional deductive approach, this book looks into the fundamental ideas in discrete mathematics, including graph theory, combinatorics, number theory, coding theory, combinatorial optimization and abstract algebra. It can be approached by anyone with basic competence in arithmetic and experience of simple algebraic manipulations and students of computer science whose curriculum may now allow the study of many ancillary mathematics courses. The main changes to this new edition are to present descriptions of numerous algorithms on a form close to that of a real programming language. The aim is to enable students to develop practical programs from the design of algorithms.
目次
- Part 1 Numbers and counting: integers
- functions and counting
- principles of counting
- subsets and designs
- partition, classification and distribution
- modular arithmetic. Part 2 Graphs and algorithms: algorithms and their efficiency
- graphs
- trees, sorting and searching
- bipartite graphs and matching problems
- digraphs, networks and flows
- recursive techniques. Part 3 Algebraic methods: groups
- groups of permutations
- rings, fields,and polynomials
- finite fields and some applications
- error-correcting codes
- generating functions
- partitions of a positive integer
- symmetry and counting.
- 巻冊次
-
: pbk. ISBN 9780198534273
内容説明
Using a traditional deductive approach, this book looks into the fundamental ideas in discrete mathematics, including graph theory, combinatorics, number theory, coding theory, combinatorial optimization and abstract algebra. It can be approached by anyone with basic competence in arithmetic and experience of simple algebraic manipulations and students of computer science whose curriculum may now allow the study of many ancillary mathematics courses. The main changes to this new edition are to present descriptions of numerous algorithms on a form close to that of a real programming language. The aim is to enable students to develop practical programs from the design of algorithms.
目次
- PART I: NUMBERS AND COUNTING: Integers
- Functions and counting
- Principles of counting
- Subsets and designs
- Partition, classification, and distribution
- Modular arithmetic
- PART II: GRAPHS AND ALGORITHMS
- Algorithms and their efficiency
- Graphs
- Trees, sorting, and searching
- Bipartite graphs and matching problems
- Digraphs, networks, and flows
- Recursive techniques
- PART III: ALGEBRAIC METHODS: Groups
- Groups of permutations
- Rings, fields, and polynomials
- Finite fields and some applications
- Error-correcting codes
- Generating functions
- Partitions of a positive integer
- Symmetry and counting
- Answers to selected exercises
- Index
「Nielsen BookData」 より