Mathematics for Computer Science

Discrete and Finite Mathematics Published 2017 12958.3 KB ✓ Verified Direct PDF

Overview & Synopsis

This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. It explores the topics of basic combinatorics, number and graph theory, logic and proof techniques, and many more.

Indexed from repository: FreeComputerBooks.com (freecomputerbooks.com)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title Mathematics for Computer Science
Author / Organization Eric Lehman, F. Thomson Leighton, Albert R. Meyer
Subject & Discipline Discrete and Finite Mathematics, Graph Theory, Combinatorics and Game Theory, Algebra, Abstract Algebra, and Linear Algebra, Mathematical Logic (Set Theory, etc.), Probability and Stochastic Processes
Categories Discrete and Finite Mathematics
Publication Year 2017
ISBN 978-1680921229
License / Rights CC BY-SA 3.0
Resource Verification ✓ Verified Direct PDF Available
Alternative Mirrors & Links
Original Host Website FreeComputerBooks.com (freecomputerbooks.com)
File Format application/pdf (Portable Document Format)
Reported File Size 12958.3 KB (13,269,308 bytes)
Language ENGLISH
Catalog ID DOC-95889
Original Source Link Visit Source Page on freecomputerbooks.com »
Commercial / Print Edition

Prefer a Physical Book or Kindle Edition?

Mathematics for Computer Science • Print Edition
As an Amazon Associate, MainReads earns from qualifying purchases.