time hierarchy theorem
E1435283
UNEXPLORED
The time hierarchy theorem is a fundamental result in computational complexity theory that shows more computational time allows strictly more problems to be solved, establishing a proper hierarchy of time-bounded complexity classes.
All labels observed (1)
| Label | Occurrences |
|---|---|
| time hierarchy theorem canonical | 3 |
How this entity was disambiguated
This entity first appeared as the object of triple T20512664 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: time hierarchy theorem Context triple: [speedup theorem, relatedTo, time hierarchy theorem]
-
A.
complexity class EXPTIME
EXPTIME is a computational complexity class consisting of decision problems that can be solved by a deterministic Turing machine in exponential time with respect to the size of the input.
-
B.
Kleene hierarchy
The Kleene hierarchy is a classification of sets and predicates in arithmetic and recursion theory based on their definability and complexity, introduced by logician Stephen Kleene.
-
C.
Furst–Saxe–Sipser lower bounds
Furst–Saxe–Sipser lower bounds are foundational results in circuit complexity theory that established superpolynomial lower bounds for constant-depth Boolean circuits (AC⁰), demonstrating inherent limitations of such circuits for computing certain functions.
-
D.
Babai–Fortnow–Lund–Safra–Szegedy theorem
The Babai–Fortnow–Lund–Safra–Szegedy theorem is a landmark result in computational complexity theory that characterizes the power of multi-prover interactive proofs by showing they capture exactly the class of nondeterministic exponential-time problems.
-
E.
MIP equals NEXP
MIP equals NEXP is a landmark complexity-theoretic result showing that problems solvable by multi-prover interactive proofs exactly match those solvable in nondeterministic exponential time.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: time hierarchy theorem Target entity description: The time hierarchy theorem is a fundamental result in computational complexity theory that shows more computational time allows strictly more problems to be solved, establishing a proper hierarchy of time-bounded complexity classes.
-
A.
complexity class EXPTIME
EXPTIME is a computational complexity class consisting of decision problems that can be solved by a deterministic Turing machine in exponential time with respect to the size of the input.
-
B.
Kleene hierarchy
The Kleene hierarchy is a classification of sets and predicates in arithmetic and recursion theory based on their definability and complexity, introduced by logician Stephen Kleene.
-
C.
Furst–Saxe–Sipser lower bounds
Furst–Saxe–Sipser lower bounds are foundational results in circuit complexity theory that established superpolynomial lower bounds for constant-depth Boolean circuits (AC⁰), demonstrating inherent limitations of such circuits for computing certain functions.
-
D.
Babai–Fortnow–Lund–Safra–Szegedy theorem
The Babai–Fortnow–Lund–Safra–Szegedy theorem is a landmark result in computational complexity theory that characterizes the power of multi-prover interactive proofs by showing they capture exactly the class of nondeterministic exponential-time problems.
-
E.
MIP equals NEXP
MIP equals NEXP is a landmark complexity-theoretic result showing that problems solvable by multi-prover interactive proofs exactly match those solvable in nondeterministic exponential time.
- F. None of above. chosen
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.