Posted by: atri | December 9, 2010

Lect 40: NP-Completeness

In today’s lecture we saw the P vs. NP question and how if one can solve the Hamiltonian Cycle problem then one can also solve the Shortest Path problem. The slides have been uploaded.

On Friday, I’ll give an overview of my main research interests (and we will see some problems with different algorithmic flavor). For the remaining time, I’ll take questions, so come prepared!

Here is a link to Thirusajee Thanasinganathan‘s blog post for the lecture.


Leave a Reply

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

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


%d bloggers like this: