Probabilistic Methods for Algorithmic Discrete Mathematics Image close
Probabilistic Methods for Algorithmic Discrete Mathematics on Hardback
Probabilistic Methods for Algorithmic Discrete Mathematics on Hardback
Show Hide Adult Content
Probabilistic Methods for Algorithmic Discrete Mathematics close

Non-Fiction Books:

Home  
Books  
Non-Fiction  
Maths & Science  
Mathematics  
Combinatorics & graph theory

Probabilistic Methods for Algorithmic Discrete Mathematics

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Format:

Hardback
$292.00
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
0 in Trolley
Free Delivery with Primate
Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

4 payments of $73.00 with Afterpay Learn more

6 weekly interest-free payments of $48.67 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 8-18 July using International Courier

Explore more Algorithms and Combinatorics

See all products in this series

Systems Analysis by Graphs and Matroids by Kazuo Murota
$290.00
Systems Analysis by Graphs and Matroids
by Kazuo Murota ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Matrices and Matroids for Systems Analysis by Kazuo Murota
$437.00
Matrices and Matroids for Systems Analysis
by Kazuo Murota ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Discrete and Computational Geometry on Hardback
$461.00
Discrete and Computational Geometry
Hardback
Available - Usually ships in 3-4 weeks
Combinatorics and Complexity of Partition Functions on Hardback by Alexander Barvinok
$367.00
Combinatorics and Complexity of Partition Functions
by Alexander Barvinok ~ Hardback
Available - Usually ships in 3-4 weeks
Mathematics of Ramsey Theory
$289.00
Mathematics of Ramsey Theory
Paperback / softback
Available - Usually ships in 3-4 weeks
Graph Colouring and the Probabilistic Method on Hardback by Michael Molloy
$435.00
Graph Colouring and the Probabilistic Method
by Michael Molloy ~ Hardback
Available - Usually ships in 3-4 weeks
Combinatorial Optimization by Bernhard Korte
$188.00
Combinatorial Optimization
by Bernhard Korte ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Combinatorics and Complexity of Partition Functions by Alexander Barvinok
$365.00
Combinatorics and Complexity of Partition Functions
by Alexander Barvinok ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Optimal Interconnection Trees in the Plane on Hardback by Marcus Brazil
$155.00
Optimal Interconnection Trees in the Plane
by Marcus Brazil ~ Hardback
Available - Usually ships in 3-4 weeks
The Simplex Method by Karl Heinz Borgwardt
$148.00
The Simplex Method
by Karl Heinz Borgwardt ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Geometric Discrepancy
$451.00
Geometric Discrepancy
Paperback / softback
Available - Usually ships in 3-4 weeks
Irregularities of Partitions
$148.00
Irregularities of Partitions
Paperback / softback
Available - Usually ships in 3-4 weeks
Greedoids by Bernhard Korte
$148.00
Greedoids
by Bernhard Korte ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Geometric Algorithms and Combinatorial Optimization by Laszlo Lovasz
$418.00
Geometric Algorithms and Combinatorial Optimization
by Laszlo Lovasz ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Linear Optimization and Extensions on Hardback by Manfred Padberg
$298.00
Linear Optimization and Extensions
by Manfred Padberg ~ Hardback
Available - Usually ships in 3-4 weeks
Sparsity on Hardback by Jaroslav Nesetril
$272.00
Sparsity
by Jaroslav Nesetril ~ Hardback
Available - Usually ships in 3-4 weeks

Description

The book gives an accessible account of modern probabilistic methods for analyzing combinatorial structures and algorithms. It will be an useful guide for graduate students and researchers.Special features included: a simple treatment of Talagrand's inequalities and their applications; an overview and many carefully worked out examples of the probabilistic analysis of combinatorial algorithms; a discussion of the "exact simulation" algorithm (in the context of Markov Chain Monte Carlo Methods); a general method for finding asymptotically optimal or near optimal graph colouring, showing how the probabilistic method may be fine-tuned to exploit the structure of the underlying graph; a succinct treatment of randomized algorithms and derandomization techniques.
Release date NZ
August 19th, 1998
Audiences
  • Postgraduate, Research & Scholarly
  • Professional & Vocational
Contributors
  • Edited by Bruce Reed
  • Edited by Colin McDiarmid
  • Edited by Jorge Ramirez-Alfonsin
  • Edited by Michel Habib
Illustrations
XVII, 325 p.
Pages
325
Dimensions
156x234x20
ISBN-13
9783540646228
Product ID
3106223

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Recommended for you

Recommended from your browsing history

Help & options

Filed under...

Books >
Non-Fiction >
Maths & Science >
Mathematics >
Combinatorics & graph theory
Books >
Non-Fiction >
Maths & Science >
Mathematics >
Probability & statistics
Books >
Non-Fiction >
Maths & Science >
Mathematics >
Applied mathematics >
Stochastics
Books >
Non-Fiction >
Maths & Science >
Mathematics >
Discrete mathematics
Books >
Computers & Internet >
Computer science >
Mathematical theory of computation
Books >
Computers & Internet >
Computer science >
Mathematical theory of computation >
Maths for computer scientists