Matches in Harvard for { <http://id.lib.harvard.edu/aleph/009015079/catalog> ?p ?o. }
Showing items 1 to 22 of
22
with 100 items per page.
- catalog contributor b12673188.
- catalog created "2002.".
- catalog date "2002".
- catalog date "2002.".
- catalog dateCopyrighted "2002.".
- catalog description "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.".
- catalog extent "xiv, 425 p. :".
- catalog identifier "0198507178 (hbk : alk. paper)".
- catalog identifier "0198507186 (pbk : alk. paper)".
- catalog identifier "9780198507178 (hbk : alk. paper)".
- catalog identifier "9780198507185 (pbk : alk. paper)".
- catalog issued "2002".
- catalog issued "2002.".
- catalog language "eng".
- catalog publisher "Oxford [England] ; New York : Oxford University Press,".
- catalog subject "004/.01/51 21".
- catalog subject "Computer science Mathematics.".
- catalog subject "Informatique Mathématiques.".
- catalog subject "QA76.9.M35 B54 2002".
- catalog tableOfContents "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.".
- catalog title "Discrete mathematics / Norman L. Biggs.".
- catalog type "text".