Discrete Mathematics, Том 1Macmillan, 1993 - Всего страниц: 800 This best-selling book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem- solving techniques. This edition has the techniques of proofs woven into the text as a running theme and each chapter has the problem-solving corner. The text provides complete coverage of: Logic and Proofs; Algorithms; Counting Methods and the Pigeonhole Principle; Recurrence Relations; Graph Theory; Trees; Network Models; Boolean Algebra and Combinatorial Circuits; Automata, Grammars, and Languages; Computational Geometry. For individuals interested in mastering introductory discrete mathematics. |
Содержание
Contents | 2 |
Boolean Algebras and Combinatorial | 9 |
The Language of Mathematics | 63 |
Авторские права | |
Не показаны другие разделы: 12
Часто встречающиеся слова и выражения
a₁ a₂ adjacency matrix b₁ binary search tree binary tree C₁ C₂ conditional proposition contain defined Definition domain of discourse edge incident elements equation equivalence classes equivalence relation Euclidean algorithm Euler cycle Example false Find formula function G₁ G₂ game tree given graph G graph of Figure greatest common divisor Hamiltonian cycle Huffman code Inductive Step initial condition input isomorphic labeled length loop mathematical induction minimal spanning tree Multiplication Principle n-cube nonisomorphic number of comparisons obtain one-to-one ordered pairs Output P₁ permutation Pigeonhole Principle planar player positive integer problem procedure proof prove quantified statement R₁ R₂ real number recurrence relation recursive algorithm reflexive rooted trees s₁ SECTION shortest path Show shown in Figure simple graph solution subgraph subsets subtree Suppose symmetric t₁ T₂ terminal vertices Theorem trominoes true v₁ v₂ vertex weighted graph worst-case Write an algorithm x₁