Probabilistic Methods for Algorithmic Discrete Mathematics

Häftad, Engelska, 2010

Del i serien Algorithms and Combinatorics

1 064 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

Some of the most convincing demonstrations of the power of these tech niques are randomized algorithms for estimating quantities which are hard to compute exactly. One example is the randomized algorithm of Dyer, Frieze and Kannan for estimating the volume of a polyhedron.

Produktinformation

Utgivningsdatum:2010-08-18
Mått:155 x 235 x 16 mm
Vikt:500 g
Format:Häftad
Språk:Engelska
Serie:Algorithms and Combinatorics
Antal sidor:325
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783642084263

Utforska kategorier

Innehållsförteckning

The Probabilistic Method.- Probabilistic Analysis of Algorithms.- An Overview of Randomized Algorithms.- Mathematical Foundations of the Markov Chain Monte Carlo Method.- Percolation and the Random Cluster Model: Combinatorial and Algorithmic Problems.- Concentration.- Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms.- Author Index.