Revision history of "The complexity class DTIME"

From Polymath1Wiki
Jump to: navigation, search

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 2009WikiSysop (Talk | contribs). . (436 bytes) (+436). . (New page: DTIME<math>(f(n))</math> is the class of decision problems that can be solved by a deterministic Turing machine in time <math>O(f(n))</math>. Note that the time hierarchy theorem implies ...)