Alert icon
We're changing our privacy policy. This stuff matters.  Learn more  Dismiss

Lecture - 27 NP - Compliteness - II

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
11,881
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Aug 27, 2008

Lecture Series on Design & Analysis of Algorithms by Prof.Sunder Vishwanathan, Prof.Abhiram Ranade, Department of Computer Science Engineering,IIT Bombay. For more details on NPTEL visit http://nptel.iitm.ac.in

Category:

Education

Tags:

License:

Standard YouTube License

Link to this comment:

Share to:

Top Comments

  • you spelled 'Completeness' wrong on the title.

  • this video's off the hook

see all

All Comments (4)

Sign In or Sign Up now to post a comment!
  • It is one thing to read books and to listen to videos like this. Thank you IIT for this.

    This video covers: Hamiltonian cycle and path Decision vs Search problem Proving vs Verification Notion of NP Class

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more