15-453 Formal Languages, Automata, and Computation
Lecture 28: Polynomial Time

We introduce the class of polynomial time computable functions and explore some problems in this class.

• Reading: Ch. 7.2, pp. 232-236
• Previous lecture: Time Complexity
• Next lecture: Some Problems in P

[ Home | Schedule | Assignments | Handouts | Overview ]

fp@cs
Frank Pfenning