**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

**Isabelle/HOL: A Proof Assistant for Higher-Order Logic**

by

**T. Nipkow, L.C. Paulson, M. Wenzel**-

**Springer**

This book is a self-contained introduction to interactive proof in higher-order logic, using the proof assistant Isabelle. It is a tutorial for potential users. The book has three parts: Elementary Techniques; Logic and Sets; Advanced Material.

(

**10395**views)

**Computer Algebra, Algorithms, Systems and Applications**

by

**Richard Liska, at al.**-

**Czech Technical University**

From the table of contents: Introduction; Algorithms for algebraic computation; Integrated mathematical systems; Basic possibilities of integrated mathematical systems; Applications of computer algebra; Another sources of study.

(

**10671**views)

**Mathematics for Computer Scientists**

by

**Gareth J. Janacek, Mark L. Close**-

**BookBoon**

In this textbook you will find the basic mathematics needed by computer scientists. It should help you to understand the meaning of mathematical concepts. Subjects as elementary logic, factorization, plotting functions and matrices are explained.

(

**18580**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.

(

**10241**views)