Discrete Mathematics
Format:Paperback
Publisher:American Mathematical Society
Published:30th Oct '07
Should be back in stock very soon
The advent of fast computers and the search for efficient algorithms revolutionized combinatorics and brought about the field of discrete mathematics. This book is an introduction to the main ideas and results of discrete mathematics, and with its emphasis on algorithms it should be interesting to mathematicians and computer scientists alike. The book is organized into three parts: enumeration, graphs and algorithms, and algebraic systems. There are 600 exercises with hints and solutions to about half of them. The only prerequisites for understanding everything in the book are linear algebra and calculus at the undergraduate level.
Praise for the German edition ... ""This book is a well-written introduction to discrete mathematics and is highly recommended to every student of mathematics and computer science as well as to teachers of these topics."" - Konrad Engel for MathSciNet
""Aigner offers a very enjoyable review of discrete mathematics at the graduate level."" - Choice Reviews
""This book gives a leisurely and clear exposition of the main topics of discrete mathematics."" - Allen Stenger for MAA Reviews
ISBN: 9781470470630
Dimensions: unknown
Weight: unknown
388 pages