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 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.
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 S. Basu, R. Pollack, M. Roy - Springer
The monograph gives a detailed exposition of the algorithmic real algebraic geometry. It is well written and will be useful both for beginners and for advanced readers, who work in real algebraic geometry or apply its methods in other fields.
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.