deterministic time hierarchy theorem
GPTKB entity
Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:consequence |
P is strictly contained in EXPTIME
|
| gptkbp:field |
theoretical computer science
|
| gptkbp:hasConcept |
theoretical computer science
DTIME(f(n)) time-constructible function |
| https://www.w3.org/2000/01/rdf-schema#label |
deterministic time hierarchy theorem
|
| gptkbp:implies |
there are problems solvable in more time that are not solvable in less time
|
| gptkbp:provenBy |
gptkb:Richard_E._Stearns
Jurís Hartmanis |
| gptkbp:publishedIn |
gptkb:Journal_of_the_ACM
|
| gptkbp:relatedTo |
nondeterministic time hierarchy theorem
space hierarchy theorem |
| gptkbp:state |
for time-constructible functions f and g, if f(n) log f(n) = o(g(n)), then DTIME(f(n)) is strictly contained in DTIME(g(n))
|
| gptkbp:yearProved |
1965
|
| gptkbp:bfsParent |
gptkb:P_vs_EXPTIME
|
| gptkbp:bfsLayer |
6
|