6.856J | Fall 2002 | Graduate

Randomized Algorithms

Lecture Notes

n3.pdf

Description:

Lecture notes on Yao’s Minimax Principle and Adelman’s Theorem.

Resource Type:
Lecture Notes
pdf
87 kB
n3.pdf
Download File

Course Info

Departments
As Taught In
Fall 2002
Level
Graduate
Topics
Learning Resource Types
Lecture Notes
Problem Sets
Problem Set Solutions
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2025 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2025 Massachusetts Institute of Technology