Live briefing
Everything about NTIME
Complexity class
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 that runs in time O(f(n)), where O is the big O notation, f is some function, and n is the size of the input (for which the problem is to be decided). Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: NTIMEA 5-minute orientation
- Pick up a classic book: Gospel music artist directory, 1994The most-reprinted book on the subject
- Read the landmark paper: NTIME-DEPENDENT RELIABILITY ANALYSIS OF PIPELINES INTEGRATING BURST PRESSURE MODELING, FATIGUE CRACK GROWTH, AND STOCHASTIC OPERATIONAL LOADINGCited 0 times
- Go sideways: Time hierarchy theoremA closely related topic
- Go sideways: Padding argumentA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
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…
- Padding argument In computational complexity theory, the padding argument is a tool to conditionally prove that if some complexity classes are equal, then some other bigger…
- Circuit complexity In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according…
- Savitch's theorem In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, gives a relationship between deterministic and non-deterministic…
- P (complexity) In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that can…
- Boolean circuit In computational complexity theory and circuit complexity, a Boolean circuit is a mathematical model for combinational digital logic circuits. A formal…
- PR (complexity) PR is the complexity class of all primitive recursive functions—or, equivalently, the set of all formal languages that can be decided in time bounded by…
- DSPACE In computational complexity theory, DSPACE or SPACE is the computational resource describing the resource of memory space for a deterministic Turing machine…