|By Subject > Science and Mathematics > Computer Science and Operations Research > 2 > Foundations of Combinatorics with Applications|
This introduction to combinatorics, the foundation of the interaction between computer science and mathematics, is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics.
|Foundations of Combinatorics with Applications|
|Author:||Edward A. Bender, S. Gill Williamson|
|Contents:||Click to View|
|Dimensions:||6 1/2 x 9 1/4|
The four-part treatment begins with a section on counting and listing that covers basic counting, functions, decision trees, and sieving methods. The following section addresses fundamental concepts in graph theory and a sampler of graph topics. The third part examines a variety of applications relevant to computer science and mathematics, including induction and recursion, sorting theory, and rooted plane trees. The final section, on generating functions, offers students a powerful tool for studying counting problems. Numerous exercises appear throughout the text, along with notes and references. The text concludes with solutions to odd-numbered exercises and to all appendix exercises.
Revised version of the Redwood City, California, 1991 edition.
|Ready to Buy?|
Add this to your cart
(you can always remove it later.)
Shopping here is Guaranteed Safe!
|Here's a sample of other Dover titles that may interest your customers.|
|A Short Course in Discrete Mathematics|
by Edward A. Bender
S. Gill Williamson
Explores Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Assumes some familiarity with calculus. Original 2005 edition. read more
|Introductory Discrete Mathematics|
by V. K . Balakrishnan
This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. More than 200 exercises, many with complete solutions. 1991 edition. read more
by D. J. A. Welsh
Text by a noted expert describes standard examples and investigation results, using elementary proofs to develop basic matroid properties before advancing to a more sophisticated treatment. Includes numerous exercises. 1976 edition. read more
|Boolean Algebra and Its Applications|
by J. Eldon Whitesitt
Introductory treatment begins with set theory and fundamentals of Boolean algebra, proceeding to concise accounts of applications to symbolic logic, switching circuits, relay circuits, binary arithmetic, and probability theory. 1961 edition. read more
|Lattice Theory: First Concepts and Distributive Lattices|
by George Grätzer
This outstanding text is written in clear language and enhanced with many exercises, diagrams, and proofs. It discusses historical developments and future directions and provides an extensive bibliography and references. 1971 edition. read more