18.409 | Fall 2009 | Graduate

Topics in Theoretical Computer Science: An Algorithmist's Toolkit

Lecture Notes

Lecture 5

Description:

Lecture notes on Monte Carlo methods, DNF counting and an exponentially small target, and an FPRAS for approximating the permanent of a dense graph.

Resource Type:
Lecture Notes
pdf
415 kB
Lecture 5
Download File

Course Info

Departments
As Taught In
Fall 2009
Level
Graduate
Topics
Learning Resource Types
Problem Sets
Lecture Notes
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