DLOGTIME
In
computation time on a deterministic Turing machine. It must be defined on a random-access Turing machine, since otherwise the input tape is longer than the range of cells that can be accessed by the machine. It is a very weak model of time complexity: no random-access Turing machine with a smaller deterministic time bound can access the whole input.[1]
Examples
DLOGTIME includes problems relating to verifying the length of the input,binary search.
Applications
DLOGTIME-