BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Probabilistic Methods in Combinatorial Analysis

Probabilistic Methods in Combinatorial Analysis

Probabilistic Methods in Combinatorial Analysis
Stock photo: cover may vary

Probabilistic Methods in Combinatorial Analysis Hardback -

by V. Sachkov V. N. Sachov V. N. Sachkov

Add to wish list
  • New
  • Hardback
New

Description

Cambridge University Press CUP , pp. 260 . Hardback. New.
Ask the seller a question Add to wish list
A$360.41
A$5.82 Delivery within USA
Standard delivery: 9 to 14 days
More delivery options
Ships from Cold Books (New York, United States)

Details

  • Title Probabilistic Methods in Combinatorial Analysis
  • Author V. Sachkov V. N. Sachov V. N. Sachkov
  • Binding Hardback
  • Condition New
  • Pages 260
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press CUP
  • Publication date pp. 260
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index
  • Bookseller's Inventory # 6248480
  • ISBN 9780521455121 / 052145512X
  • Weight 1 lbs (0.45 kg)
  • Dimensions 9.47 x 6.4 x 0.81 in (24.05 x 16.26 x 2.06 cm)
  • Category Mathematics
  • Library of Congress subjects Combinatorial analysis, Probabilities
  • Library of Congress Catalogue Number 94030891
  • Dewey Decimal Code 519.2
  • Quantity available 4

About Cold Books New York, United States

Biblio member since 2012

Terms of Sale: 30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Cold Books

Reader reviews for Probabilistic Methods in Combinatorial Analysis

From the publisher

This work explores the role of probabilistic methods for solving combinatorial problems. The subjects studied 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 define 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 important book describes many ideas not previously available in English and will be of interest to graduate students and professionals in mathematics and probability theory.
tracking-