Friday, June 3, 2011

Lecture 22

Computational Depth Continued

Scribe Notes by Kai Hayashi

L. Antunes, L. Fortnow, A. Pinto, and A. Souto. Low-depth witnesses are easy to find. In Proceedings of the 22nd IEEE Conference on Computational Complexity, pages 46-51. IEEE, New York, 2007.


L. Antunes and L. Fortnow. Worst-case running times for average-case algorithms. In Proceedings of the 24th IEEE Conference on Computational Complexity, pages 298-303. IEEE, 2009. 

Wednesday, June 1, 2011

Lecture 21

Equivalence of MDL, Kolmogorov Structure Function and Best Fit

Intro to Computational Depth

Scribe Notes by Aleck Johnsen

L. Antunes, L. Fortnow, D. van Melkebeek, and N. Vinodchandran. Computational depth: Concept and applicationsTheoretical Computer Science, 354(3):391-404, April 2006.

Friday, May 27, 2011

Monday, May 9, 2011

Student Presentations

Lecture 19

Ct and CDt complexity. Bounding sizes of sets with CD complexity.

Friday, May 6, 2011

Lecture 18

Levin's Kt complexity and universal search

Scribe Notes by Arefin Huq

N. Devanur and L. Fortnow. A computational theory of awareness and decision making. In Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge, pages 99-107. ACM, 2009.



Wednesday, May 4, 2011