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.
Friday, June 3, 2011
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 applications. Theoretical Computer Science, 354(3):391-404, April 2006.
Intro to Computational Depth
Scribe Notes by Aleck Johnsen
L. Antunes, L. Fortnow, D. van Melkebeek, and N. Vinodchandran. Computational depth: Concept and applications. Theoretical Computer Science, 354(3):391-404, April 2006.
Subscribe to:
Posts (Atom)