Posted by: atri | May 11, 2011

Lecture 40: Approximating NP-witnesses

On May 2nd, we saw how we can use list decoding to problem of approximating NP-witnesses in computational complexity.

I did not get time to talk about the many important topics that we did not get to cover in this course. Here is an old blog post with a list of topics that we did not get to study in this course.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: