Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
computational complexity hypothesis
|
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
EXPTIME hypothesis
|
| gptkbp:implies |
P ≠ NP
NP is not in P/poly |
| gptkbp:proposedBy |
gptkb:Larry_Stockmeyer
|
| gptkbp:relatedTo |
gptkb:EXPTIME
gptkb:P_vs_NP_problem NP |
| gptkbp:significance |
has implications for circuit lower bounds
has implications for cryptography has implications for derandomization |
| gptkbp:state |
NP is not contained in P/poly
|
| gptkbp:yearProposed |
1976
|
| gptkbp:bfsParent |
gptkb:PSPACE_vs_EXPTIME
|
| gptkbp:bfsLayer |
6
|