**Browse**

*Best Selling*

**Language**

*English* (17)

French (0)

German (0)

Spanish (1)

Italian (0)

**Category**

**Audience**

Adult (17)

**Protection**

*All* (17)

DRM Free (0)

DRM (17)

This volume provides a wide selection of problems (and solutions) to all those interested in mathematical problem solving and is accessible to readers from high school students to professionals.

It is a resource...

This is a textbook for an introductory combinatorics course that can take up one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section,...

This is the first book on the theory of multiple zeta values since its birth around 1994. Readers will find that the shuffle products of multiple zeta values are applied to complicated counting problems in combinatorics,...

Introductory text surveys the theory of permutations and combinations associated with elementary algebra; the principle of inclusion and exclusion; and the theory of distributions and partitions in cyclic representation....

Voronoi diagrams partition space according to the influence certain sites exert on their environment. Since the 17th century, such structures play an important role in many areas like Astronomy, Physics, Chemistry,...

This book is the essential companion to *Counting (2nd Edition)* (World Scientific, 2013), an introduction to combinatorics for secondary to undergraduate students. The book gives solutions to the exercises in...

This book in its Second Edition is a useful, attractive introduction to basic counting techniques for upper secondary to undergraduate students, as well as teachers. Younger students and lay people who appreciate...

A textbook suitable for undergraduate courses. The materials are presented very explicitly so that students will find it very easy to read. A wide range of examples, about **500 combinatorial problems** taken from...

This updated edition presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete...

This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local...

Volume I of a two-part series, this book features a broad spectrum of 100 challenging problems related to probability theory and combinatorial analysis. Most can be solved with elementary mathematics. Complete...

This book is an introduction to the geometry of Euclidean, affine, and projective spaces with special emphasis on the important groups of symmetries of these spaces. The two major objectives of the text are...

Derived from the techniques of analytic number theory, sieve theory employs methods from mathematical analysis to solve number-theoretical problems. This text by a noted pair of experts is regarded as the definitive...

How many possible sudoku puzzles are there? In the lottery, what is the chance that two winning balls have consecutive numbers? Who invented Pascal's triangle? (it was not Pascal) Combinatorics, the branch of...

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the...

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the...

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the...