Discrete Mathematics (inbunden)
Format
Inbunden (Hardback)
Språk
Engelska
Antal sidor
440
Utgivningsdatum
2002-12-01
Upplaga
2
Förlag
OUP Oxford
Illustratör/Fotograf
Numerous Figures
Illustrationer
figs.
Dimensioner
30 x 197 x 254 mm
Vikt
880 g
Antal komponenter
1
ISBN
9780198507185

Discrete Mathematics

Inbunden,  Engelska, 2002-12-01
2864
  • Skickas från oss inom 10-15 vardagar.
  • Fri frakt över 249 kr för privatkunder i Sverige.
Finns även som
Visa alla 1 format & utgåvor
The new edition of this text includes additional chapters on statements and proof, logical framework, and natural numbers and the integers. The updated chapters offer over 1000 tailored exercises, and an accompanying website contains hints and solutions to all exercises.
Visa hela texten

Passar bra ihop

  1. Discrete Mathematics
  2. +
  3. The Anxious Generation

De som köpt den här boken har ofta också köpt The Anxious Generation av Jonathan Haidt (inbunden).

Köp båda 2 för 3153 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av Norman L Biggs

Recensioner i media

EMS A well known definition says that a textbook is a book such that everybody thinks he can write a better one. Biggs' Discrete Mathematics is an exception - not only for its wide range of topics and its clear organization but notably for its excellent style of explanation.

Innehållsförteckning

THE LANGUAGE OF MATHEMATICS; 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; TECHNIQUES; 10. Principles of counting; 11. Subsets and designs; 12. Partition, classification and distribution; 13. Modular arithmetic; 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; 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