This lecture introduces problem complexity theory, an important area of theoretical computer science. We start with simple problems like multiplication and build up to much more complicated problems, to help analyze how the difficulty of solving them should be understood. We will discuss various classes of problem classification based on the time/space requirements needed to solve them, theoretical models used in such analysis and available resources, including Quantum Computing, when the complexity involved in solving a problem is too high.
Quantum Computing Videos referred in the lecture:
th-cam.com/video/-1PsQIciMEc/w-d-xo.html
th-cam.com/video/-UlxHPIEVqA/w-d-xo.html