Mathematics for Algorithm and Systems Analysis
by Edward A. Bender, S. Gill Williamson
Publisher: Dover Publications 2005
Number of pages: 256
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.
Home page url
Download or read it online for free here:
(multiple PDF files)
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.
by Victor Shoup - Cambridge University Press
This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes. It is accessible to a broad audience. Prerequisites are a typical undergraduate course in calculus and some experience in doing proofs.
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.
by Cameron Davidson-Pilon - GitHub, Inc.
This book is designed as an introduction to Bayesian inference from a computational understanding-first, and mathematics-second, point of view. The book assumes no prior knowledge of Bayesian inference nor probabilistic programming.