skip to main | skip to sidebar

15-855: Intensive Intro to Computational Complexity

http://www.cs.cmu.edu/~odonnell/complexity/

Thursday, January 29, 2009

Lecture 6

In this class we finished the proof of the Approximate Counting/Sampling and the Bshouty-Cleve-Gavalda-Kannan-Tamon Theorem. We also introduced #P.
Posted by Ryan O'Donnell at 10:42 PM

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)
    • ▼  January (17)
      • Misc. Definitions
      • Partial Derandomization of Polynomial Identity Che...
      • Lecture 6
      • Partial Derandomization of Polynomial Identity Che...
      • Trivial lemma => powerful circuit lower bounds
      • Lecture 5
      • If pigs could whistle, then horses could fly
      • The many characterizations of NP
      • Polylog-wise independence fools constant-depth cir...
      • Lecture 4
      • Lecture 3
      • Blogroll
      • Tentative syllabus
      • Lecture 2
      • Lecture 1
      • Homework Template
      • History of Complexity
  • ►  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