𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Discrete mathematics with algorithms

✍ Scribed by Michael O. Albertson, Joan P. Hutchinson


Book ID
127453905
Publisher
Wiley
Year
1988
Tongue
English
Weight
3 MB
Edition
1st Updated
Category
Library
City
New York
ISBN-13
9780471849025

No coin nor oath required. For personal study only.

✦ Synopsis


This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic problem-solving. All algorithms are presented in English, in a format compatible with the Pascal programming language. Contains many exercises, with answers at the back of the book (detailed solutions being supplied for difficult problems).


πŸ“œ SIMILAR VOLUMES


Probabilistic methods for algorithmic di
✍ Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed πŸ“‚ Library πŸ“… 1998 πŸ› Springer 🌐 English βš– 2 MB

The book gives an accessible account of modern probabilistic methods for analyzing combinatorial structures and algorithms. It will be an useful guide for graduate students and researchers. Special features included: a simple treatment of Talagrand's inequalities and their applications; an overview

Probabilistic methods for algorithmic di
✍ Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed πŸ“‚ Library πŸ“… 1998 πŸ› Springer 🌐 English βš– 4 MB

The book gives an accessible account of modern probabilistic methodsfor analyzing combinatorial structures and algorithms. It will be anuseful guide for graduate students and researchers. Special featuresincluded: a simple treatment of Talagrand's inequalities and theirapplications; an overview and

Discrete mathematics with applications
✍ Thomas Koshy πŸ“‚ Library πŸ“… 2004 πŸ› Elsevier Academic Press 🌐 English βš– 5 MB

This approachable text studies discrete objects and the relationsips that bind them. It helps students understand and apply the power of discrete math to digital computer systems and other modern applications. It provides excellent preparation for courses in linear algebra, number theory, and modern

Discrete mathematics
✍ James Hein πŸ“‚ Library πŸ“… 1996 πŸ› Jones and Bartlett Publishers 🌐 English βš– 4 MB

Discrete Mathematics, is designed for an introductory course in discrete mathematics for the prospective computer scientist, applied mathematician, or engineer who wants to learn how the ideas apply to computer sciences. The choice of topics-and the breadth of coverage-reflects the desire to provide