EECS 395/495 Kolmogorov Complexity Spring 2011

Wednesday, May 4, 2011

Lecture 17

Inequalities for entropy hold for K-complexity. Time-bounded complexity

Happy 40th to P versus NP!
Posted by Lance Fortnow at Wednesday, May 04, 2011
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Information

  • Home
  • Basic Course Information
  • Readings
  • Papers for Presentation

Blog Archive

  • ▼  2011 (24)
    • ►  June (2)
    • ▼  May (6)
      • Lecture 20
      • Student Presentations
      • Lecture 19
      • Lecture 18
      • Lecture 17
      • Lecture 16
    • ►  April (13)
    • ►  March (2)
    • ►  February (1)

About Me

My photo
Lance Fortnow
View my complete profile
Simple theme. Powered by Blogger.