Discrete Algorithmic Mathematics - Couverture rigide

Maurer, Stephen B.; Ralston, Anthony

Couverture rigide

ISBN 10 : 0201155850 ISBN 13 : 9780201155853

Editeur : Addison Wesley, 1991

Synopsis

approx 900p red hardback, excellent condition, almost as new, internally well bound, exercises and solutions, indices

A propos du livre

Présentation de l'éditeur

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.

Présentation de l'éditeur

Well-known and highly regarded, Discrete Algorithmic Mathematics is an outstanding text for a half- or full-year course in discrete mathematics. Written in a clear and lively style, the book's emphasis is on themes and ideas, making it more coherent and extensive than other discrete mathematics textbooks.

Détails de l'édition

• Éditeur: Addison Wesley
• Date d'édition: 1991
• Langue: anglais
• ISBN 10: 0201155850
• ISBN 13: 9780201155853
• Reliure: Relié
• Numéro d'édition: 1
• Nombre de pages: 114
• Coordonnées du fabricant: non disponible
• Personne responsable: GS1 Slovakia; https://www.gs1sk.org; ; Nantersk� 23; Žilina; 010 08; Slovaquie