Mathematics for Computer Science
Lehman, Eric; Leighton, F Thomson; Meyer, Albert R
Sold by Biblios, Frankfurt am main, HESSE, Germany
AbeBooks Seller since September 10, 2024
New - Soft cover
Condition: New
Quantity: 4 available
Add to basketSold by Biblios, Frankfurt am main, HESSE, Germany
AbeBooks Seller since September 10, 2024
Condition: New
Quantity: 4 available
Add to basketPRINT ON DEMAND pp. 1010.
Seller Inventory # 18380361547
This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.
The color images and text in this book have been converted to grayscale.
"About this title" may belong to another edition of this title.
To ensure faster delivery, books may be shipped from any of the following locations Germany, the United Kingdom (UK), the United States (US), based on the buyer's address and product availability.