A&DS S02E15. Complexity Classes

Algorithms and data structures. Semester 2. Lecture 15.

At the last lecture, we talked about which problems can be solved in polynomial time, which can be solved in non-polynomial time, and which are not solvable at all. We also discussed how some problems can be reduced to others and showed that the knapsack problem is NP-complete

ITMO University, 2021

[MehbubulHasanAlQuvi]

Are we going to get the S03 lectures in English as well?

[deepakahuja]

sir, can you make a playlist on Competitive Programming.i am from india and there is a high craze of competitive programming, and youtube don't have an appropriate CP tutorial, it will be helpful to lot of students if you can make videos on CP with detailed problem solving.