Историческая физика. т.1

Pt. 1. Fundamentals Of Discrete Mathematics -- Fundamental Principles Of Counting -- Fundamentals Of Logic -- Set Theory -- Properties Of The Integers : Mathematical Induction -- Relations And Functions -- Languages : Finite State Machines -- Relations : The Second Time Around -- Pt. 2. Further Topics In Enumeration -- The Principle Of Inclusion And Exclusion -- Generating Functions -- Recurrence Relations -- Pt. 3. Graph Theory And Applications -- An Introduction To Graph Theory -- Trees -- Optimization And Matching -- Pt. 4. Modern Applied Algebra -- Rings And Modular Arithmetic -- Boolean Algebra And Switching Functions -- Groups, Coding Theory, And Polya's Method Of Enumeration -- Finite Fields And Combinatorial Designs. Ralph P. Grimaldi. Includes Bibliographical References And Index. This fifth edition continues to improve on the features that have made it the market leader. The text offers a flexible organization, enabling instructors to adapt the book to their particular courses. The book is both complete and careful, and it continues to maintain its emphasis on algorithms and applications. Excellent exercise sets allow students to perfect skills as they practice. This new edition continues to feature numerous computer science applications-making this the ideal text for preparing students for advanced study. This text offers a flexible organization, enabling tutors to adapt the book according to their particular courses. It continues to maintain its emphasis on algorithms and application and should prove useful as a tool to help students prepare for advanced study.