P, NP, NP hard, NP Complete classes of language in theory of computation | TOC | lec-70
Advertisement
About this video
This video is part of the Theory of Computation (TOC) lecture series by Er Sahil Ka Gyan for RTU B.Tech students (4th Sem). It is video 71 of 74 in the series.
More from Theory of Computation (TOC)
2:0669
Halting Problem and Rice theorem | TOC | lec-68
3:1970
Chomsky hierarchy of grammar in theory of computation | TOC | lec-69
2:0072
Hamiltonian path problems with Example in theory of computation | TOC | lec-71
2:2473
Travelling salesman problem in Theory of computation in hindi | TOC | lec-72
2:1174
Can u prove this in theory of computation? | 1M$ Prize problem in theory of computation | TOC | lec-73
Advertisement