Combinatorial Methods with Computer Applications (Discrete Mathematics and Its Applications) by Jonathan L. Gross

by Jonathan L. Gross

Ideal for classroom use as well as self-study, Combinatorial Methods with Applications provides a solid, applications-oriented grounding in combinatorics, covering core areas such as sequences, recursions, generating functions, evaluation of sums, and graphs. The discussion of useful topics like partitions and polynomials, algebraic counting, and designs is particularly pertinent to the fields of electrical engineering, operations research, and computer science. Unlike many books on the subject, this resource is fully illustrated with close to 300 figures and only requires a foundation in discrete mathematics.

Hardcover

First published November 16, 2007