Discrete and combinatorial mathematics - Info and Reading Options
an applied introduction
By Ralph P. Grimaldi
"Discrete and combinatorial mathematics" was published by Addison-Wesley in 1999 - Reading, Mass, it has 791 pages and the language of the book is English.
“Discrete and combinatorial mathematics” Metadata:
- Title: ➤ Discrete and combinatorial mathematics
- Author: Ralph P. Grimaldi
- Language: English
- Number of Pages: 791
- Publisher: Addison-Wesley
- Publish Date: 1999
- Publish Location: Reading, Mass
- Dewey Decimal Classification: 510
- Library of Congress Classification: QA39.2 .G748 1999
“Discrete and combinatorial mathematics” Subjects and Themes:
- Subjects: ➤ Mathematics - Computer science - Combinatorial analysis - Algebra - Electronic data processing - Mathématiques - Computer science, mathematics - Discrete groups - Computer science--mathematics - Qa39.2 .g748 1994 - 510 - Qa39.2 .g748 2004 - Analyse combinatoire - Informatique
- Time: 1961-
Edition Specifications:
- Number of Pages: ➤ xix, 791, [138] p. : ill. ; 25 cm.
- Pagination: ➤ xix, 791p. A1-34, S1-84, I1-20 :
Edition Identifiers:
- The Open Library ID: OL18441788M - OL1901959W
- Online Computer Library Center (OCLC) ID: 39042966
- Library of Congress Control Number (LCCN): 98023912 - ^^^98023912^
- ISBN-13: 9780201304244
- ISBN-10: 0201304244
- All ISBNs: 0201304244 - 0201199122 - 9780201304244
AI-generated Review of “Discrete and combinatorial mathematics”:
"Discrete and combinatorial mathematics" Table Of Contents:
- 1- 1. Fundamentals of Discrete Mathematics
- 2- 2. Fundamentals of Logic
- 3- 3. Set Theory
- 4- 4. Properties of the Integers: Mathematical Induction
- 5- 5. Relations and Functions
- 6- 6. Languages: Finite State Machines
- 7- 7. Further Topics in Enumeration
- 8- 8. Generating Functions
- 9- 9. Recurrence Relations
- 10- 10. Graph Theory and Applications
- 11- 11. Trees
- 12- 12. Optimization and Matching
- 13- 13. Modern Applied Algebra
- 14- 14. Boolean Algebra and Switching Functions
- 15- 15. Groups, Coding Theory, and Polya's Method of Enumeration
- 16- 16. Finite Fields and Combinatorial Designs.
"Discrete and combinatorial mathematics" Description:
Harvard Library:
Discrete and Combinatorial Mathematics continues to improve upon the features that have made it the market leader. The Fourth Edition has added more elementary problems, and features numerous science applications -- making this the ideal book for preparing students for advanced study.
Read “Discrete and combinatorial mathematics”:
Read “Discrete and combinatorial mathematics” by choosing from the options below.
Search for “Discrete and combinatorial mathematics” downloads:
Visit our Downloads Search page to see if downloads are available.
Find “Discrete and combinatorial mathematics” in Libraries Near You:
Read or borrow “Discrete and combinatorial mathematics” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Discrete and combinatorial mathematics” at a library near you.
- Harvard University Library: Location: Widener Library, Harvard University - Shelf Numbers: QA39.2 .G748 1999
Buy “Discrete and combinatorial mathematics” online:
Shop for “Discrete and combinatorial mathematics” on popular online marketplaces.
- Ebay: New and used books.