skip to main
|
skip to sidebar
15-855: Intensive Intro to Computational Complexity
http://www.cs.cmu.edu/~odonnell/complexity/
Monday, March 30, 2009
Midterm correction
On problem #4 on the midterm, assume $w \geq n$.
Thanks to Or for pointing out the necessity of this.
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)
▼
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)
►
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.