Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

DPD courier 4.99 € GLS courier 9.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Probabilistic Methods in Combinatorial Analysis

Name: Probabilistic Methods in Combinatorial Analysis
Brand: Cambridge University Press
SKU: 02024522
Price: 69.7 EUR
Availability: InStock
Author: Vladimir N. Sachkov
ISBN: 9780521172776

Vladimir N. Sachkov

Language

English

Book Paperback

Libristo code: 02024522

Publishers Cambridge University Press, February 2011

This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These... Full description

Libristo code: 02024522

169 b

69.70 €

In stock at our supplier Shipping in 14-21 days

Up to 30 days for returns

Customers also purchased

ABC der fabelhaften Prinzessinnen Willy Puchner

Hardback

19.66 €

Organisationsstrukturen der Theologie in der Universität. Martin Heckel

Paperback

37.62 €

Chow Chow Momente. Fellpoesie aus dem Reich der Mitte (Wandkalender 2026 DIN A4 quer), CALVENDO Monatskalender Calvendo

Calendar

21.28 €

Verhaltenspflichten des Aufsichtsrats bei Vorliegen eines feindlichen Übernahmeangebots. Marc Alexander Schmieder

Paperback

84.73 €

Puzzle 4 w 1 Super kolor. Stitch

Jigsaw puzzle

4.73 €

Internetökonomie und Ethik Detlef AufderHeide

Paperback

74.34 €

Elitný klub Angela Marsonsová

Hardback

15.32 €

Les petits devoirs - Conjugaison CE2 Guigui

Paperback

10.18 €

Der Kleine Drache Kokosnuss - Schulausflug ins Abenteuer Ingo Siegner

Hardback

8.77 €

FILMAUSWEIDER - Das Splattermovies Magazin - Ausgabe 4 - Evil Dead, Texas Chainsaw 3D, The ABCs of Death, The Collection, The Bay, Citadel, The Millen Andreas Port

Paperback

5.14 €

Wir von der Bernhard Jörg Meyer zu Altenschildesche

Hardback

22.29 €

Nagy elmozdulások mérése holografikus interferometriával Béla Ráczkevi

Paperback

44.38 €

KOSF Karty oceny sluchu fonemowego

Paperback

56.89 €

This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as characteristic and generating functions, the moment method and so on but also let us use the powerful technique of limit theorems. The basic objects under investigation are nonnegative matrices, partitions and mappings of finite sets, with special emphasis on permutations and graphs, and equivalence classes specified on sequences of finite length consisting of elements of partially ordered sets; these specify the probabilistic setting of Sachkov's general combinatorial scheme. The author pays special attention to using probabilistic methods to obtain asymptotic formulae that are difficult to derive using combinatorial methods. This was an important book, describing many ideas not previously available in English; the author has taken the chance to rewrite parts of the text and refresh the references where appropriate.