Mathematics for Computer Science
by Eric Lehman, F Thomson Leighton, Albert R Meyer
Publisher: MIT 2010
Number of pages: 557
Description:
This text offers an introduction to Discrete Mathematics oriented toward Computer Science and Engineering. Topics covered: Fundamental concepts of Mathematics: definitions, proofs, sets, functions, elementary number theory; Discrete structures: graphs, counting; Discrete probability theory.
Download or read it online for free here:
Download link
(3.2MB, PDF)
Similar books
Discrete Mathematics- Wikibooks
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. This book will help you think well about discrete problems: problems where tools like calculus fail because there's no continuity.
(8624 views)
Discrete Math for Computer Science Studentsby Ken Bogart, Cliff Stein - Dartmouth College
It gives thorough coverage to topics that have great importance to computer scientists and provides a motivating computer science example for each math topic. Contents: Counting; Cryptography and Number Theory; Reflections on Logic and Proof.
(3091 views)
Applied Finite Mathematicsby Rupinder Sekhon - Connexions
Applied Finite Mathematics covers topics including linear equations, matrices, linear programming (geometrical approach and simplex method), the mathematics of finance, sets and counting, probability, Markov chains, and game theory.
(7167 views)
generatingfunctionologyby Herbert S. Wilf - A K Peters, Ltd.
The book about main ideas on generating functions and some of their uses in discrete mathematics. Generating functions are a bridge between discrete mathematics and continuous analysis. The book is suitable for undergraduates.
(13937 views)