The complexity class DTIME: Revision history

From Polymath Wiki
Jump to navigationJump to search

Diff selection: Mark the radio buttons 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.

28 July 2009

  • curprev 13:3813:38, 28 July 2009‎ WikiSysop 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 ...
Retrieved from "https://michaelnielsen.org/polymath/index.php?title=The_complexity_class_DTIME"