Discrete mathematics / Norman L. Biggs.
Material type:
Item type | Current library | Call number | Copy number | Status | Notes | Date due | Barcode |
---|---|---|---|---|---|---|---|
![]() |
Female Library | QA76.9 .M35 B54 2002 (Browse shelf (Opens below)) | 1 | Available | STACKS | 51952000080916 | |
![]() |
Main Library | QA76.9 .M35 B54 2002 (Browse shelf (Opens below)) | 1 | Available | STACKS | 51952000059639 |
Browsing Female Library shelves Close shelf browser
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
QA76.9 .I546 2010 Information Systems Development Towards a Service Provision Society | QA76.9 .M3 S65 2010 Solaris 10 system administration essentials / | QA76.9 .M35 .H44 2010 Discrete structures, logic, and computability / | QA76.9 .M35 B54 2002 Discrete mathematics / | QA76.9 .M35 D83 2006 Discrete structures and automata theory / | QA76.9 .M35 G38 2010 Discrete mathematics : proofs, structures, and applications / | QA76.9 .M35 G67 2006 Computation engineering : applied automata theory and logic / |
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.