Free Delivery Over $100
|
|
|||
|
||||
OverviewThe 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 Martin Aigner is a professor of mathematics at the Free University of Berlin. He received his PhD at the University of Vienna and has held a number of positions in the USA and Germany before moving to Berlin. He is the author of several books on discrete mathematics, graph theory, and the theory of search. The Monthly article Turan's graph theorem earned him a 1995 Lester R. Ford Prize of the MAA for expository writing, and his book Proofs from the BOOK with Gunter M. Ziegler has been an international success with translations into 12 languages. Full Product DetailsAuthor: Martin AignerPublisher: American Mathematical Society Imprint: American Mathematical Society Edition: illustrated Edition Weight: 0.852kg ISBN: 9780821841518ISBN 10: 0821841513 Pages: 388 Publication Date: 30 March 2007 Audience: Professional and scholarly , Professional & Vocational Format: Hardback Publisher's Status: Active Availability: Awaiting stock  The supplier is currently out of stock of this item. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out for you. Table of ContentsCounting: Fundamentals Summation Generating functions Counting patterns Asymptotic analysis Bibliography for Part 1 Graphs and algorithms: Graphs Trees Matchings and networks Searching and sorting General optimization methods Bibliography for Part 2 Algebraic systems: Boolean algebras Modular arithmetic Coding Cryptography Linear optimization Bibliography for Part 3 Solutions to selected exercises Index.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
