Lecture 1 1 Course Overview - Computer Science at UBC ...

• cours magistral
• exposé

CPSC 536N: Randomized Algorithms 2011-12 Term 2 Lecture 1 Prof. Nick Harvey University of British Columbia 1 Course Overview 1.1 What are randomized algorithms? This course is about randomized algorithms. It is important to understand that this is not the same as average case analysis of algorithms, in which one analyzes the performance of a deterministic algorithm when the inputs are drawn from a certain distribution. Instead, we will look at algorithms that can “flip random coins” and whose behavior depends on the outcomes of those coin flips, and we will do worst-case analysis, meaning that we analyze the performance and accuracy of the algorithm on

• algorithm couldn
• failure probability
• indicator random variable
• probability that a computer
• random coins
• continuous objects into integral objects
• mathematical objects
• techniques
• algorithm
• field