CSci 301 Lecture Notes

Week Twelve, Tuesday: The Class P

P is the class of languages decidable in polynomial time on a deterministic single-tape Turing machine.

Email: Richard dot J dot Wagner at gmail dot com

notes12a.htm, this hand crafted HTML file created August 31, 1998.
Last updated May 14, 2011, by Rick Wagner. Copyright © 1998-2011, all rights reserved.