Lect 6: Hardness of Sparse Approximation problems

In today’s lecture, we saw an algorithm to solve the ERROR problem for the case of orthogonal matrices. Then we saw an overview of NP-Completeness. The stuff on ERROR is from Lecture 3 from Anna Gilbert’s notes. For a more detailed overview of NP-completeness (and different examples that we saw in class), see Lecture 4 from Anna Gilbert’s notes.

This entry was posted in Spring 2012. Bookmark the permalink.

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 )

Google+ photo

You are commenting using your Google+ 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 )


Connecting to %s