Discrete Mathematics/

"This book provides a carefully structured, coherent, and comprehensive course of Discrete Mathematics. The clarity of the exposition, and the scope of the contents has made it a popular choice for students and teachers of mathematics, computer science, operational research, and related subject...

Full description

Bibliographic Details
Main Author: Biggs, Norman L., author 306897
Format: text
Language:eng
Published: New York : Oxford University Press, 2002
Subjects:
_version_ 1824460110549745664
author Biggs, Norman L., author 306897
author_facet Biggs, Norman L., author 306897
author_sort Biggs, Norman L., author 306897
collection OCEAN
description "This book provides a carefully structured, coherent, and comprehensive course of Discrete Mathematics. The clarity of the exposition, and the scope of the contents has made it a popular choice for students and teachers of mathematics, computer science, operational research, and related subjects. The topics covered include the elements of graph theory, combinatorics, number theory, the theory of algorithms, abstract algebra, and coding theory."--Jacket
first_indexed 2025-02-19T04:52:28Z
format text
id KOHA-OAI-TEST:613632
institution Universiti Teknologi Malaysia - OCEAN
language eng
last_indexed 2025-02-19T04:52:28Z
publishDate 2002
publisher New York : Oxford University Press,
record_format dspace
spelling KOHA-OAI-TEST:6136322025-02-18T04:01:31ZDiscrete Mathematics/ Biggs, Norman L., author 306897 textNew York : Oxford University Press,2002©2002eng"This book provides a carefully structured, coherent, and comprehensive course of Discrete Mathematics. The clarity of the exposition, and the scope of the contents has made it a popular choice for students and teachers of mathematics, computer science, operational research, and related subjects. The topics covered include the elements of graph theory, combinatorics, number theory, the theory of algorithms, abstract algebra, and coding theory."--Jacketpt. 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."This book provides a carefully structured, coherent, and comprehensive course of Discrete Mathematics. The clarity of the exposition, and the scope of the contents has made it a popular choice for students and teachers of mathematics, computer science, operational research, and related subjects. The topics covered include the elements of graph theory, combinatorics, number theory, the theory of algorithms, abstract algebra, and coding theory."--JacketUnknown;Computer scienceURN:ISBN:9780198507178
spellingShingle Computer science
Biggs, Norman L., author 306897
Discrete Mathematics/
title Discrete Mathematics/
title_full Discrete Mathematics/
title_fullStr Discrete Mathematics/
title_full_unstemmed Discrete Mathematics/
title_short Discrete Mathematics/
title_sort discrete mathematics
topic Computer science
work_keys_str_mv AT biggsnormanlauthor306897 discretemathematics