Combinatorics (Wiley-Interscience Series in Discrete Mathematics and Optimization)

✍ Scribed by Russell Merris

Year: 2003
Tongue: English
Leaves: 573
Edition: 2
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

A mathematical gem–freshly cleaned and polishedThis book is intended to be used as the text for a first course in combinatorics. the text has been shaped by two goals, namely, to make complex mathematics accessible to students with a wide range of abilities, interests, and motivations; and to create a pedagogical tool, useful to the broad spectrum of instructors who bring a variety of perspectives and expectations to such a course.Features retained from the first edition:Lively and engaging writing styleTimely and appropriate examplesNumerous well-chosen exercisesFlexible modular formatOptional sections and appendicesHighlights of Second Edition enhancements:Smoothed and polished exposition, with a sharpened focus on key ideasExpanded discussion of linear codesNew optional section on algorithmsGreatly expanded hints and answers sectionMany new exercises and examples

📜 SIMILAR VOLUMES

Combinatorics (Wiley Series in Discrete

📁 Combinatorics (Wiley Series in Discrete Mathematics and Optimization)

✍ Russell Merris 📂 Library 📅 2003 🏛 Wiley-Interscience 🌐 English

There is no question that combinatorics is becoming more important in the practice of computer science. While some of the most important techniques are covered in discrete mathematics courses, there is not enough breadth or depth in the coverage. As a consequence, one of my goals this upcoming year

Integer and Combinatorial Optimization (

📁 Integer and Combinatorial Optimization (Wiley Series in Discrete Mathematics and Optimization)

✍ Laurence A. Wolsey, George L. Nemhauser 📂 Library 📅 1988 🏛 Wiley-Interscience 🌐 English

<span>Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION<br> <br> "This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with mor

The Probabilistic Method (Wiley-Intersci

📁 The Probabilistic Method (Wiley-Interscience Series in Discrete Mathematics and Optimization)

✍ Noga Alon, Joel H. Spencer 📂 Library 📅 2008 🏛 Wiley-Interscience 🌐 English

The Probabilistic Method (Wiley-Intersci

📁 The Probabilistic Method (Wiley-Interscience Series in Discrete Mathematics and Optimization)

✍ Noga Alon, Joel H. Spencer 📂 Library 📅 2008 🏛 Wiley-Interscience 🌐 English

I happen to love studying probability theory and the probabilistic method and this is the book I come to time and time again. It is well organized and provides great, straightforward, insightful explanations. However, its main strength is its wealth of beautiful (fairly recently) results (in varied

Trees and Proximity Representations (Wil

📁 Trees and Proximity Representations (Wiley-Interscience Series in Discrete Mathematics and Optimization)

✍ Jean-Pierre Barthelemy Alain Guenoche 📂 Library 📅 1991 🏛 John Wiley & Sons 🌐 English

Describes the combinatorial analysis of data using trees as the model, and the use of this model in representing proximities. This technique is of great importance in many applications including such fields as computer science, decision theory, artificial intelligence, information theory, experiment

The Probabilistic Method, Second edition

📁 The Probabilistic Method, Second edition (Wiley-Interscience Series in Discrete Mathematics and Optimization)

✍ Noga Alon 📂 Library 📅 2000 🌐 English

The 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