Live briefing
Everything about DLOGTIME
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. 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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: DLOGTIMEA 5-minute orientation
- Read the landmark paper: A characterisation of P by DLOGTIME-uniform families of polarizationless P systems using only dissolution rulesCited 1 times
- Go sideways: DSPACEA closely related topic
- Go sideways: Complexity classA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
📚 Books worth reading
Open Library didn't respond; try again in a moment.
🔗 Related topics
- DSPACE In computational complexity theory, DSPACE or SPACE is the computational resource describing the resource of memory space for a deterministic Turing machine…
- Complexity class In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly…
- Computational complexity theory In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource…
- NL (complexity) Unsolved problem in computer science 𝖫=?𝖭𝖫 More unsolved problems in computer science In computational complexity theory, NL (Nondeterministic Logarithmic-spa…
- Space complexity The space complexity of an algorithm or a data structure is the amount of memory space required to solve an instance of the computational problem as a…
- L (complexity) In computational complexity theory, L (also known as LSPACE, LOGSPACE or DLOGSPACE) is the complexity class containing decision problems that can be solved…
- Log-space reduction In computational complexity theory, a log-space reduction is a reduction computable by a deterministic Turing machine using logarithmic space. Conceptually…
- NC (complexity) Unsolved problem in computer science 𝖭𝖢=?𝖯 More unsolved problems in computer science In computational complexity theory, the class NC (for Nick's…