skip to main

skip to sidebar
15855: Intensive Intro to Computational Complexity
http://www.cs.cmu.edu/~odonnell/complexity/
Tuesday, April 14, 2009
Lecture 24
In today's class we covered many of the
gory details of expander graphs
. I didn't quite get a chance to finish the last details, so there are the notes.
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
Blog Archive
▼
2009
(73)
►
May
(4)
▼
April
(20)
Lecture 28
Game theory complexity and computing Nash Equilibr...
Last lecture
Course evaluations
Lecture 27
Lecture 26
Blogging
Lecture 25
Homework 5 Correction
Easy Witnesses
THURSDAY'S CLASS CANCELED
Lecture 24
Bounds on BQP
Midterm correction
Details for the IKW Theorem
Lecture 23
Why there isn't a simpler proof of IKW
Lecture 22
Homework 5
Lecture 21
►
March
(12)
►
February
(20)
►
January
(17)
►
2008
(1)
►
December
(1)
Labels
Lecture Summary
(28)
Announcement
(21)
Beyond the Lectures
(15)
Lecture Details
(3)
Encoding
(1)
Kolmogorov
(1)
Learning Theory
(1)
NP
(1)
complexity classes
(1)
derandomization
(1)
descriptive complexity theory
(1)
Subscribe To
Posts
Atom
Posts
Comments
Atom
Comments
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.