Discrete mathematics / Norman L. Biggs.
Material type:
TextPublisher: Oxford [England] ; New York : Oxford University Press, 2002Edition: 2nd edDescription: xiv, 425 p. : ill. ; 26 cmISBN: 0198507178 (hbk : alk. paper); 9780198507178 (hbk : alk. paper); 0198507186 (pbk : alk. paper); 9780198507185 (pbk : alk. paper)Subject(s): Computer science -- MathematicsDDC classification: 510 LOC classification: QA76.9.M35 | B54 2002Online resources: Publisher description | Table of contents only | Item type | Current library | Call number | Copy number | Status | Notes | Date due | Barcode |
|---|---|---|---|---|---|---|---|
Books
|
Female Library | QA76.9 .M35 B54 2002 (Browse shelf (Opens below)) | 1 | Available | STACKS | 51952000080916 | |
|
Books
|
Main Library | QA76.9 .M35 B54 2002 (Browse shelf (Opens below)) | 1 | Available | STACKS | 51952000059639 |
Includes index.
Pt. I. Foundations. 1. Statements and proofs. 2. Set notation. 3. The logical framework. 4. Natural numbers. 5. Functions. 6. How to count. 7. Integers. 8. Divisibility and prime numbers. 9. Fractions and real numbers -- Pt. II. Techniques. 10. Principles of counting. 11. Subsets and designs. 12. Partition, classification, and distribution. 13. Modular arithmetic -- Pt. III. Algorithms and Graphs. 14. Algorithms and their efficiency. 15. Graphs. 16. Trees, sorting, and searching. 17. Bipartite graphs and matching problems. 18. Digraphs, networks, and flows. 19. Recursive techniques -- Pt. IV. Algebraic Methods. 20. Groups. 21. Groups of permutations. 22. Rings, fields, and polynomials. 23. Finite fields and some applications. 24. Error-correcting codes. 25. Generating functions. 26. Partitions of a positive integer. 27. Symmetry and counting.
1 2
There are no comments on this title.