Discrete Mathematical Structures
Prentice Hall, 1996 - Computer science - 524 pages
Tying together discrete mathematical topics with a theme, this text stresses both basic theory and applications, offering students a firm foundation for more advanced courses. It limits the mathematics required (no calculus), and explains the small amount of linear algebra that is needed. The book uses algorithms and pseudocode to illustrate techniques, provides coding exercises and features sections on mathematical structures, the predicate calculus, recurrence relations, functions for computer science, growth of functions and minimal spanning trees. (0-13-375064-7) are available.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
algorithm applications approximation binary operation Boolean algebra boundary conditions called circuit coefficients congruence congruence relation Consider construct corresponding coset decoding defined denote described determine differential equations digraph discrete domain edges elements equivalence relation error Euler Euler path Example EXERCISE SET formula given grammar graph grid Hasse diagram Hence homomorphism input integer interpolation isomorphic iteration labeled lattice Let G linear systems mathematical induction matrix method monoid Moore machine multiplication nonlinear obtain parallel parameter partial order partition path permutations polynomial poset positive integer problem Proof properties Prove pseudocode real numbers recursive regular expression scheme Section semigroup sequence shown in Figure Sobolev spaces solution solving space spanning tree statement step string structure subgroup subroutine subset subspace subtree Suppose symbol symmetric symmetric relation Theorem theory tion transitive true values variables vector vertex vertices wavelets write zero