15-453 Formal Languages, Automata, and Computation
Lecture 37: Space Complexity

We define space complexity and complexity classes in analogy with the time complexity classes considered so far. We then give examples of problems which can be solved in polynomial space and consider the relationship between time and space.


[ Home | Schedule | Assignments | Handouts | Overview ]

fp@cs
Frank Pfenning