PDC4S:\Coding\GATE 2021 RavindraBabu Ravula\Algorithms\14.NP Completeness (Not required for GATE) Complexity Classes | ||
 Up one directory... | ||
 | ||
 1.Introduction.m4v | ||
| 10.Well know NP complete problems.mp4 | ||
| 2.Types of algorithms.m4v | ||
| 3.some examples.m4v | ||
| 4.Optimisation and Decision problems.mp4 | ||
| 5.We use only decision problems in NP completeness theory.mp4 | ||
| 6.Verfication algorithms.mp4 | ||
| 7.P NP Introduction.mp4 | ||
| 8.Polynomial time reduction algorithms.mp4 | ||
| 9.NP hard and NP complete problems.mp4 | ||