𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

Discrete Algorithmic Mathematics, Third Edition

✍ Scribed by Stephen B. Maurer, Anthony Ralston

Publisher
A K Peters/CRC Press
Year
2005
Tongue
English
Leaves
803
Edition
3
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis

Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. It has been updated with new or extended discussions of order notation, generating functions, chaos, aspects of statistics, and computational biology. Written in a lively, clear style that talks to the reader, the book is unique for its emphasis on algorithmics and the inductive and recursive paradigms as central mathematical themes. It includes a broad variety of applications, not just to mathematics and computer science, but to natural and social science as well.

A manual of selected solutions is available for sale to students; see sidebar. A complete solution manual is available free to instructors who have adopted the book as a required text.

✦ Subjects

ΠœΠ°Ρ‚Π΅ΠΌΠ°Ρ‚ΠΈΠΊΠ°;ДискрСтная ΠΌΠ°Ρ‚Π΅ΠΌΠ°Ρ‚ΠΈΠΊΠ°;

πŸ“œ SIMILAR VOLUMES

Discrete Algorithmic Mathematics, Third
πŸ“ Discrete Algorithmic Mathematics, Third Edition
✍ Maurer, Stephen B.; Ralston, Anthony πŸ“‚ Library πŸ“… 2005 πŸ› CRC Press;A.K.Peters, CRC 🌐 English

Front Cover; List of Algorithms; Contents; Instructor's Preface; Student's Preface; Chapter Summaries; Pathways Through the Book; Problem Difficulty Rating; Symbols, Notation, Abbreviations and Conventions; Prologue: What is Discrete Algorithmic Mathematics?; CHAPTER 0: Mathematical Preliminaries ;

Discrete Mathematics, Third Edition
πŸ“ Discrete Mathematics, Third Edition
✍ Kenneth A. Ross, Charles R. B. Wright πŸ“‚ Library πŸ“… 1992 πŸ› PH 🌐 English

This third edition offers an introduction to discrete mathematics, covering relations, induction, counting techniques, logic and graphs. More advanced topics of Boolean algebra and permutation groups are included, and there are numerous examples to reinforce the material.

Discrete algorithmic mathematics
πŸ“ Discrete algorithmic mathematics
✍ Maurer S.B., Ralston A. πŸ“‚ Library πŸ“… 1991 πŸ› Addison Wesley 🌐 English

Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. It has been updated with new or extended discussions of order notation, generating functions, chaos, aspects of statistics, and computational biology.

Discrete Algorithmic Mathematics
πŸ“ Discrete Algorithmic Mathematics
✍ Stephen B. Maurer, Anthony Ralston πŸ“‚ Library πŸ“… 2005 🌐 English

Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. It has been updated with new or extended discussions of order notation, generating functions, chaos, aspects of statistics, and computational biology.