Hitler and P = NP


For the love of all decidable things, watch this video!

By the way, the shortest path problem is not NP-Hard. It’s polynomial time complexity for all kinds of graphs in terms of number of vertices and edges. It seems that the person who made this video has confused the shortest path problem with the traveling salesman problem which is NP-Hard.

Cheers!

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