Revision history of "The complexity class DTIME"

Diff selection: Mark the radio boxes of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

• (cur | prev) 14:38, 28 July 2009‎ ‎ . . (436 bytes) (+436). . (New page: DTIME$(f(n))$ is the class of decision problems that can be solved by a deterministic Turing machine in time $O(f(n))$. Note that the time hierarchy theorem implies ...)