Live briefing
Everything about DTIME
Deterministic time, in computational complexity theory
In computational complexity theory, DTIME is the computational resource of computation time for a deterministic Turing machine. It represents the amount of time that a "normal" physical computer would take to solve a certain computational problem using a certain algorithm. It is one of the most well-studied complexity resources, because it corresponds so closely to an important real-world resource. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: DTIMEA 5-minute orientation
- Pick up a classic book: Venerable ancesterThe most-reprinted book on the subject
- Read the landmark paper: Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))Cited 36 times
- Go sideways: Time hierarchy theoremA closely related topic
- Go sideways: EXPTIMEA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
📚 Books worth reading
- 📕Venerable ancesterHarry Hussey
- 📕Ovejita Que Sabía Contar y Otros Cuentos con Beso para Las Buenas Noches / Be Dtime Stories with a Good Night KissVanesa Perez-Sauquillo, Almudena APARICIO · 2021
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Time hierarchy theorem In computational complexity theory, the time hierarchy theorems are important statements about time-bounded computation on Turing machines. Informally…
- EXPTIME In computational complexity theory, the complexity class EXPTIME (sometimes called EXP or DEXPTIME) is the set of all decision problems that are solvable…
- 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…
- DSPACE In computational complexity theory, DSPACE or SPACE is the computational resource describing the resource of memory space for a deterministic Turing machine…
- NSPACE In computational complexity theory, non-deterministic space or NSPACE is the computational resource describing the memory space for a non-deterministic…
- 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…
- NTIME In computational complexity theory, the complexity class NTIME(f(n)) is the set of decision problems that can be solved by a non-deterministic Turing machine…