
- Home
- Books
- Mathematics & Theoretical CS
- Probabilistic Methods for Algorithmic Discrete Mathematics
Mathematics & Theoretical CSIn Stock
Probabilistic Methods for Algorithmic Discrete Mathematics
Price৳ 250
Probabilistic Methods for Algorithmic Discrete Mathematics by Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed collects probabilistic techniques used in discrete mathematics and algorithm analysis. The edited volume connects random structures with methods for proving algorithmic and combinatorial results. Its chapters develop tools for reasoning about events, concentration and randomized processes, with applications that show why a probabilistic argument can solve a problem that resists a direct construction.
What you will learn
- Apply probabilistic arguments to discrete problems
- Analyze randomized algorithms and structures
- Use probability bounds in combinatorial proofs
Who this is for
Graduate students and researchers in algorithms and discrete mathematics. A working knowledge of probability and proof techniques is expected.


