EECS 395/495 Kolmogorov Complexity Spring 2011
Friday, April 22, 2011
Lecture 12
Proof of constructive LLL. Overview of Circuit Complexity and Switching Lemma.
L
. Fortnow and S. Laplante.
Circuit lower bounds
a la
Kolmogorov
.
Information and Compuation
, 123(1):121-126, 1995.
Scribe Notes
by Arefin Huq
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment