Discrete Mathematics for Computer ScientistsThis is a new edition of a successful introduction to discrete mathematics for computer scientists, updated and reorganised to be more appropriate for the modern day undergraduate audience. Discrete mathematics forms the theoretical basis for computer science and this text combines a rigorous approach to mathematical concepts with strong motivation of these techniques via practical examples. Key Features
0201360616B04062001 |
Contents
The natural numbers | 1 |
Introductory logic | 48 |
Sets relations and functions | 85 |
Copyright | |
13 other sections not shown
Common terms and phrases
addition algebra algorithm allowed apply assume binary calculate called Chapter circuit codeword colours complexity connected consider correct corresponding deduce defined definition described determine digits edges elements equal equation equivalence example Exercises expression factor field Figure finite formal formula function give given graph Hence holds illustrate important induction infinite input instance integer language least length linear logic look machine matrix means method multiplication natural Note notion obtain occur operations pairs partial ordering path polynomial positive possible probability problem proof properties propositional Prove Question recursive relation represented respectively result Show shown solution space steps strings subset Suppose symbols Table Theorem tree true truth variables vector vertex vertices write