Discrete Mathematics

Norman L. Biggs (Autor)

Buch | Softcover

494 Seiten

1990 | 2nd Revised edition
Clarendon Press (Verlag)
978-0-19-853427-3 (ISBN)

Infos

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.

Autor

Norman L. Biggs is Professor of Mathematics, London School of Economics, University of London

Inhalt

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

Produkt-Details

• Zusatzinfo: numerous figures and tables
• Verlagsort: Oxford
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Informatik ► Theorie / Studium
• Themenwelt: Mathematik / Informatik ► Mathematik ► Graphentheorie
• ISBN-10: 0-19-853427-2 / 0198534272
• ISBN-13: 978-0-19-853427-3 / 9780198534273
• Zustand: Neuware