skip to main
|
skip to sidebar
15-855: Intensive Intro to Computational Complexity
http://www.cs.cmu.edu/~odonnell/complexity/
Wednesday, February 25, 2009
Homework 2 wrapup
By the way: #4 is a theorem of Krentel; the class in #5 is actually called
S
2
P
(not
S
) and the problem is a theorem of Cai; #6 is a theorem of Mulmuley-Valiant-Vazirani.
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)
▼
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
Office hours today
Tuesday's class canceled
Average Case Hardness
Lecture 8
Lecture 7
Homework 2
►
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.