Hartmanis–Stearns conjecture
GPTKB entity
Statements (12)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:field |
gptkb:theoretical_computer_science
|
| gptkbp:proposedBy |
gptkb:Richard_E._Stearns
gptkb:Juris_Hartmanis 1965 |
| gptkbp:relatedTo |
gptkb:P_versus_NP_problem
gptkb:time_hierarchy_theorem |
| gptkbp:sentence |
No superpolynomial time computable function can be computed in polynomial time by a multitape Turing machine.
|
| gptkbp:status |
open problem
|
| gptkbp:bfsParent |
gptkb:Jurisd_Hartmanis
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hartmanis–Stearns conjecture
|