Discrete Algorithmic Mathematics
Autor Stephen B. Maurer, Anthony Ralstonen Limba Engleză Hardback – 21 ian 2005
Preț: 646.56 lei
Preț vechi: 851.63 lei
-24% Nou
Puncte Express: 970
Preț estimativ în valută:
123.73€ • 128.40$ • 103.42£
123.73€ • 128.40$ • 103.42£
Carte tipărită la comandă
Livrare economică 15-29 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781568811666
ISBN-10: 1568811667
Pagini: 804
Ilustrații: 9/1/11 - book went back to Replika per JL
Dimensiuni: 191 x 235 x 52 mm
Greutate: 1.65 kg
Ediția:Revizuită
Editura: CRC Press
Colecția A K Peters/CRC Press
Locul publicării:United States
ISBN-10: 1568811667
Pagini: 804
Ilustrații: 9/1/11 - book went back to Replika per JL
Dimensiuni: 191 x 235 x 52 mm
Greutate: 1.65 kg
Ediția:Revizuită
Editura: CRC Press
Colecția A K Peters/CRC Press
Locul publicării:United States
Recenzii
The exposition is self-contained, complemented by diverse exercises and also accompanied by an introduction to mathematical reasoning … this book is an excellent textbook for a one-semester undergraduate course and it includes a lot of additional material to choose from.
—EMS, March 2006
In a textbook, it is necessary to select carefully the statements and difficulty of the problems … in this textbook, this is fully achieved … This review considers this book an excellent one.
—The Mathematical Gazette, March 2006
—EMS, March 2006
In a textbook, it is necessary to select carefully the statements and difficulty of the problems … in this textbook, this is fully achieved … This review considers this book an excellent one.
—The Mathematical Gazette, March 2006
Cuprins
PROLOGUE What Is Discrete Algorithmic Mathematics? CHAPTER 0 Mathematical Preliminaries CHAPTER 1 AlgorithmsCHAPTER 2 Mathematical Induction CHAPTER 3 Graphs and Trees CHAPTER 4 Fundamental Counting Methods CHAPTER 5 Difference Equations CHAPTER 6 Probability CHAPTER 7 An Introduction to Mathematical Logic EPILOGUE Coming Full Circle with Biology and Minimax Theorems
Notă biografică
Stephen B Maurer Swarthmore College Anthony Ralston State University of New York at Buffalo
Descriere
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, the book is unique in 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.