In computational complexity theory, DLOGTIME is the complexity class of all computational problems solvable in a logarithmic amount of computation time on a deterministic Turing machine.
DLOGTIME represents the set of problems that can be efficiently solved by a deterministic Turing machine within a logarithmic number of steps.