Books about Combinatorics from Amazon.com

....The most comprehensive guide to designing practical and efficient algorithms!....

The Algorithm Design Manual, Second Edition

"...the book is an algorithm-implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations [and] extensive bibliography make the book an invaluable resource for everyone interested in the subject." --ACM Computing Reviews

"It has all the right ingredients: rich contents, friendly, personal language, subtle humor, the right references, and a plethora of pointers to resources." -- P. Takis Metaxas, Wellesley College

"This is the most approachable book on algorithms I have." -- Megan Squire, Elon University, USA

This newly expanded and updated second edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficacy and efficiency. Expanding on the first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students.

The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques, provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, Resources, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography.

NEW to the second edition:

• Doubles the tutorial material and exercises over the first edition

• Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video

• Contains a unique catalog identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them

• Includes several NEW "war stories" relating experiences from real-world applications

• Provides up-to-date links leading to the very best algorithm implementations available in C, C++, and Java

ADDITIONAL Learning Tools:

• Exercises include "job interview problems" from major software companies

• Highlighted take-home lesson boxes emphasize essential concepts

• Provides comprehensive references to both survey articles and the primary literature

• Exercises points to relevant programming contest challenge problems

• Many algorithms presented with actual code (written in C) as well as pseudo-code

• A full set of lecture slides and additional material available at www.algorist.com

Written by a well-known algorithms researcher who received the IEEE Computer Science and Engineering Teaching Award, this new edition of The Algorithm Design Manual is an essential learning tool for students needing a solid grounding in algorithms, as well as a special text/reference for professionals who need an authoritative and insightful guide. Professor Skiena is also author of the popular Springer text, Programming Challenges: The Programming Contest Training Manual.

.
Price: $59.89 [Notify me when price goes down.]

Confusing Textbooks? Missed Lectures? Not Enough Time?

Fortunately for you, there's Schaum's Outlines More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills.

This Schaum's Outline gives you

• Practice problems with full explanations that reinforce knowledge
• Coverage of the most up-to-date developments in your course field
• In-depth review of practices and applications

Fully compatible with your classroom text, Schaum's highlights all the important facts you need to know. Use Schaum's to shorten your study time-and get your best test scores!

Schaum's Outlines-Problem Solved.

.
Price: $11.12 [Notify me when price goes down.]

.
Price: $12.41 [Notify me when price goes down.]

Geared to preparing students to make the transition from solving problems to proving theorems, this text teaches them the techniques needed to read and write proofs. The book begins with the basic concepts of logic and set theory, to familiarize students with the language of mathematics and how it is interpreted. These concepts are used as the basis for a step-by-step breakdown of the most important techniques used in constructing proofs. To help students construct their own proofs, this new edition contains over 200 new exercises, selected solutions, and an introduction to Proof Designer software. No background beyond standard high school mathematics is assumed. Previous Edition Hb (1994) 0-521-44116-1 Previous Edition Pb (1994) 0-521-44663-5.
Price: $23.25 [Notify me when price goes down.]

Elayn Martin-Gay's developmental math textbooks and video resources are motivated by her firm belief that every student can succeed Martin-Gay's focus on the student shapes her clear, accessible writing, inspires her constant pedagogical innovations, and contributes to the popularity and effectiveness of her video resources. This revision of Martin-Gay's algebra series continues her focus on students and what they need to be successful. Martin-Gay also strives to provide the highest level of instructor and adjunct support.  Real Numbers, Algebraic Expressions, Equations, Graphs, Functions, Inequalities, Systems of Equations, Exponents, Polynomial Functions, Rational Equations, Rational Exponents, Radicals, Complex Numbers, Quadratic Equations, Exponential & Logorihmic Functions, Conic Sections, and Sequences and Series.  For all readers interested in algebra, and for all readers interested in learning or revisiting essential skills in intermediate algebra through the use of lively, up-to-date applications.

 

 

 

 

 

 

 

 

 

.
Price: $102.99 [Notify me when price goes down.]

The authors help students "see the math" through their focus on functions; visual emphasis; side-by-side algebraic and graphical solutions; real-data applications; and examples and exercises. By remaining focused on today's students and their needs, the authors lead students to mathematical understanding and, ultimately, success in class.

.
Price: $88.97 [Notify me when price goes down.]

Cryptography plays a key role in ensuring the privacy and integrity of data and the security of computer networks. Introduction to Modern Cryptography provides a rigorous yet accessible treatment of modern cryptography, with a focus on formal definitions, precise assumptions, and rigorous proofs. The authors introduce the core principles of modern cryptography, including the modern, computational approach to security that overcomes the limitations of perfect secrecy. An extensive treatment of private-key encryption and message authentication follows. The authors also illustrate design principles for block ciphers, such as the Data Encryption Standard (DES) and the Advanced Encryption Standard (AES), and present provably secure constructions of block ciphers from lower-level primitives. The second half of the book focuses on public-key cryptography, beginning with a self-contained introduction to the number theory needed to understand the RSA, Diffie-Hellman, El Gamal, and other cryptosystems. After exploring public-key encryption and digital signatures, the book concludes with a discussion of the random oracle model and its applications. Serving as a textbook, a reference, or for self-study, Introduction to Modern Cryptography presents the necessary tools to fully understand this fascinating subject..
Price: $62.98 [Notify me when price goes down.]

From the Reviews:

"... Inside PFTB (Proofs from The Book) is indeed a glimpse of mathematical heaven, where clever insights and beautiful ideas combine in astonishing and glorious ways. There is vast wealth within its pages, one gem after another. Some of the proofs are classics, but many are new and brilliant proofs of classical results. ...Aigner and Ziegler... write: "... all we offer is the examples that we have selected, hoping that our readers will share our enthusiasm about brilliant ideas, clever insights and wonderful observations." I do. ... " Notices of the AMS, August 1999

"... the style is clear and entertaining, the level is close to elementary ... and the proofs are brilliant. ..." LMS Newsletter, January 1999

This third edition offers two new chapters, on partition identities, and on card shuffling. Three proofs of Euler's most famous infinite series appear in a separate chapter. There is also a number of other improvements, such as an exciting new way to "enumerate the rationals".

.
Price: $31.95 [Notify me when price goes down.]

This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to all those with a taste for mathematics and algorithms.

Richard Karp,University Professor, University of California at Berkeley

Following the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led to a beautiful theory. The need to solve truly large instances of computationally hard problems, such as those arising from the Internet or the human genome project, has also increased interest in this theory. The field is currently very active, with the toolbox of approximation algorithm design techniques getting always richer.

It is a pleasure to recommend Vijay Vazirani's well-written and comprehensive book on this important and timely topic. I am sure the reader will find it most useful both as an introduction to approximability as well as a reference to the many aspects of approximation algorithms.

László Lovász, Senior Researcher, Microsoft Research

.
Price: $37.45 [Notify me when price goes down.]

Michael Steele describes the fundamental topics in mathematical inequalities and their uses. Using the Cauchy-Schwarz inequality as a guide, Steele presents a fascinating collection of problems related to inequalities and coaches readers through solutions, in a style reminiscent of George Polya, by teaching basic concepts and sharpening problem solving skills at the same time. Undergraduate and beginning graduate students in mathematics, theoretical computer science, statistics, engineering, and economics will find the book appropriate for self-study..
Price: $26.99 [Notify me when price goes down.]