Aigner (mathematics, First U. of Berlin) writes for computer scientists and mathematicians with an interest in the main ideas behind discrete mathematics, especially algorithms. He covers counting, including the fundamentals, summation, generating functions, counting patterns, asymototic analysis; graphs and algorithms, including trees, matchings and networks, searching and sorting and general optimization methods; and algebraic systems, including Boolean algebras, modular arithmetic, coding, cryptography and linear optimization. For this English-language edition Aigner has added the chapters on counting patterns and symmetries and on coding. With its now-600 exercises, all with hints and about half with solutions, and section bibliographies, college students with an understanding of linear algebra and undergraduate calculus will also find this text helpful. Annotation ©2007 Book News, Inc., Portland, OR (booknews.com)