Lecture
This lecture covers complexity classes, including constant, logarithmic, linear, linearithmic, polynomial, exponential, and factorial complexities. It explains the effect of complexity on computer time and introduces tractable problems, the class NP, NP-complete problems, and 3-SAT.