Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Approximate Counting - Graduate Complexity Lecture at CMU

Ryan O'Donnell via YouTube

Start learning Write review
Coursera Ad

Learn AI, Data Science & Business — Earn Certificates That Get You Hired

Learn More → Scrimba Ad

Free courses from frontend to fullstack and AI

Learn More →

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This graduate lecture examines approximate counting using probability bounds, approximation amplification, randomness, and circuit constructions. It connects the topic to decision problems, satisfying assignments, and interactive proofs.

Syllabus

Introduction
Chebyshevs Inequality
Approximate counting
Decision version
Interactive proof
Decision vs approximation
Randomness

Taught by

Ryan O'Donnell

Reviews

Start your review of Approximate Counting - Graduate Complexity Lecture at CMU

Start learning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.