skip to main
|
skip to sidebar
15-855: 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.
0 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)
Wrapup
Parameterized Complexity and ETH
Lower bounds for locally decodable codes
Kolmogorov Complexity and derandomization
▼
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)
Lecture 20
Midterm correction
Lecture 19
Lecture 18
Midterm
Lecture 17
Lecture 16
Fixed-polynomial circuit lower bounds for MA/1
On the power of membership queries in agnostic lea...
Factoring
Lecture 15
Lecture 14
►
February
(20)
Recognizing/printing real numbers in real time
Lecture 13
Homework 2 wrapup
Lecture 12
Solutions to Homework 2
Derandomization of space classes
Lecture 11
Lecture 10
Homework 2 -- CORRECTION
Solutions to Homework 1
Homework 2
A Quadratic Lower Bound for the Determinant and Pe...
Combinatorial Complexity
Lecture 9
►
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
0 comments:
Post a Comment
Note: Only a member of this blog may post a comment.