# The Leading eBooks Store Online

## for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry...

#### How to Count

CRC Press 2010; US$ 83.95What?s It All About? What Is Combinatorics? Classic Problems What You Need to Know Are You Sitting Comfortably? Permutations and Combinations The Combinatorial Approach Permutations Combinations Applications to Probability Problems The Multinomial Theorem Permutations and Cycles Occupancy Problems Counting the Solutions... more...

#### The Probabilistic Method

Wiley 2004; US$ 130.00The leading reference on probabilistic methods in combinatorics-now expanded and updated When it was first published in 1991, The Probabilistic Method became instantly the standard reference on one of the most powerful and widely used tools in combinatorics. Still without competition nearly a decade later, this new edition brings you up to speed... more...

#### The Probabilistic Method

Wiley 2011; US$ 153.00Praise for the Second Edition : "Serious researchers in combinatorics or algorithm design will wish to read the book in its entirety...the book may also be enjoyed on a lighter level since the different chapters are largely independent and so it is possible to pick out gems in one's own area..." ? Formal Aspects of Computing This Third Edition... more...

#### Algorithmic aspects of combinatorics

Elsevier Science 2011; US$ 146.00Algorithmic aspects of combinatorics more...

#### The Traveling Salesman Problem: A Computational Study

Princeton University Press 2011; US$ 82.50This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home... more...

#### Matters Computational

Springer 2010; US$ 239.00This book provides algorithms and ideas for computationalists. Subjects treated include low-level algorithms, bit wizardry, combinatorial generation, fast transforms like the Fourier transform, and fast arithmetic for both real numbers and finite fields. Various optimization techniques are described and the actual performance of many given implementations... more...

#### Analysis and Design of Algorithms for Combinatorial Problems

Elsevier Science 1985; US$ 72.95Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for most of the research in graph optimization in the following... more...

#### Surveys in Combinatorics, 1997

Cambridge University Press 1997; US$ 84.00The invited lectures given at the 16th. British Combinatorial Conference, July 1997 at Queen Mary and Westfield College. more...

#### Association Schemes

Cambridge University Press 2004; US$ 52.00Association schemes for graduate mathematicians and statisticians, minimum prerequisites, numerous examples and exercises. more...

#### Combinatorics '90

Elsevier Science 1992; US$ 72.95This volume forms a valuable source of information on recent developments in research in combinatorics, with special regard to the geometric point of view. Topics covered include: finite geometries (arcs, caps, special varieties in a Galois space; generalized quadrangles; Benz planes; foundation of geometry), partial geometries, Buekenhout geometries,... more...