Probabilistic Methods for Algorithmic Discrete Mathematics cover

Probabilistic Methods for Algorithmic Discrete Mathematics

by Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed

Price৳ 250
Price৳ 250

Have a question? Ask on WhatsApp or Message on Messenger

Call 01963 822422 / 01817 506044 for help with your order

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.