**Mathematics for Algorithm and Systems Analysis**

by Edward A. Bender, S. Gill Williamson

**Publisher**: Dover Publications 2005**ISBN/ASIN**: 0486442500**ISBN-13**: 9780486442501**Number of pages**: 256

**Description**:

Discrete mathematics is an essential tool in many areas of computer science. Problems in discrete mathematics arise in programming languages, computer architecture, networking, distributed systems, database systems, AI, theoretical computer science, and other areas. This up-to-date text assists undergraduates in mastering the ideas and mathematical language to address problems that arise in the field's many applications. It consists of 4 units of study: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.

Download or read it online for free here:

**Download link**

(multiple PDF files)

## Similar books

**Axiom: The Scientific Computation System**

by

**Richard D. Jenks, Robert S. Sutor**-

**axiom-developer.org**

Axiom is a free general purpose computer algebra system. The book gives a technical introduction to AXIOM, interacts with the system's tutorial, accesses algorithms developed by the symbolic computation community, and presents advanced techniques.

(

**23799**views)

**Mathematics in the Age of the Turing Machine**

by

**Thomas Hales**-

**arXiv**

Computers have rapidly become so pervasive in mathematics that future generations may look back to this day as a golden dawn. The article gives a survey of mathematical proofs that rely on computer calculations and formal proofs.

(

**17099**views)

**Strange Attractors: Creating Patterns in Chaos**

by

**Julien C. Sprott**-

**M & T Books**

Chaos and fractals have revolutionized our view of the world. This book shows examples of the artistic beauty that can arise from very simple equations, and teaches the reader how to produce an endless variety of such patterns.

(

**21799**views)

**An Architecture for Combinator Graph Reduction**

by

**Philip J. Koopman, Jr.**-

**Academic Press**

The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented. The abstract machine, called TIGRE, exhibits reduction rates that compare favorably with previously reported techniques.

(

**18123**views)