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

Skip to content

Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis

Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis

Probability and Computing: Randomization and Probabilistic Techniques in
Stock photo: cover may vary

Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis Hardback - - 2nd Edition

by Michael Mitzenmacher; Eli Upfal

Add to wish list
  • New
  • Hardback
New

Description

Cambridge University Press CUP , . Hardback. New.
Ask the seller a question Add to wish list
A$183.95
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 Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis
  • Author Michael Mitzenmacher; Eli Upfal
  • Binding Hardback
  • Edition number 2nd
  • Edition 2
  • Condition New
  • Pages 484
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press CUP
  • Publication date
  • Features Bibliography, Index
  • Bookseller's Inventory # 6374888314
  • ISBN 9781107154889 / 110715488X
  • Weight 2.45 lbs (1.11 kg)
  • Dimensions 10 x 7.1 x 1.1 in (25.40 x 18.03 x 2.79 cm)
  • Category Computers - Languages / Programming
  • Library of Congress subjects Algorithms, Probabilities
  • Library of Congress Catalogue Number 2016041654
  • Dewey Decimal Code 518.1
  • Quantity available 1

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 Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis

From the publisher

Greatly expanded, this new edition requires only an elementary background in discrete mathematics and offers a comprehensive introduction to the role of randomization and probabilistic techniques in modern computer science. Newly added chapters and sections cover topics including normal distributions, sample complexity, VC dimension, Rademacher complexity, power laws and related distributions, cuckoo hashing, and the Lovasz Local Lemma. Material relevant to machine learning and big data analysis enables students to learn modern techniques and applications. Among the many new exercises and examples are programming-related exercises that provide students with excellent training in solving relevant problems. This book provides an indispensable teaching tool to accompany a one- or two-semester course for advanced undergraduate students in computer science and applied mathematics.
tracking-