Theory of Computation: Lecture 38. The main topics covered in this lesson include: relationship between space and time complexity; PSPACE; PSPACE-completeness and PSPACE-complete language; TQBF; non-trivial relationships; favorite complexity classes; . |