P vs EXPTIME

GPTKB entity

Statements (16)
Predicate Object
gptkbp:instanceOf computational complexity problem
gptkbp:consequence there exist problems in EXPTIME not solvable in polynomial time
gptkbp:field theoretical computer science
https://www.w3.org/2000/01/rdf-schema#label P vs EXPTIME
gptkbp:implies P ≠ EXPTIME
gptkbp:notable_for gptkb:deterministic_time_hierarchy_theorem
gptkb:time_hierarchy_theorem
gptkbp:provenBy gptkb:time_hierarchy_theorem
gptkbp:relatedTo gptkb:P_vs_NP
gptkb:EXPTIME
gptkb:P_(complexity_class)
gptkbp:solvedBy P is strictly contained in EXPTIME
gptkbp:status solved
gptkbp:type Is P equal to EXPTIME?
gptkbp:bfsParent gptkb:EXPTIME
gptkbp:bfsLayer 5