Statements (54)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:contains |
gptkb:language
decision problems |
| gptkbp:contrastsWith |
gptkb:PSPACE
gptkb:NP_(complexity_class) gptkb:EXP_(complexity_class) |
| gptkbp:definedIn |
deterministic Turing machine
|
| gptkbp:example |
sorting
linear programming maximum flow primality testing bipartite matching shortest path |
| gptkbp:fullName |
Polynomial time
|
| gptkbp:hasProperty |
closure under deterministic polynomial-time reductions
closure under Kleene star closure under Turing reductions closure under complement closure under composition closure under concatenation closure under homomorphism closure under intersection closure under inverse homomorphism closure under logspace reductions closure under many-one reductions closure under polynomial-time reductions closure under projection closure under quotient closure under rational transduction closure under regular operations closure under reversal closure under substitution closure under truth-table reductions closure under union |
| gptkbp:hasSubgroup |
gptkb:PSPACE
gptkb:NP_(complexity_class) gptkb:EXP_(complexity_class) |
| https://www.w3.org/2000/01/rdf-schema#label |
P (complexity class)
|
| gptkbp:introduced |
gptkb:John_Nash
gptkb:Jack_Edmonds |
| gptkbp:introducedIn |
1960s
|
| gptkbp:isSolvable |
polynomial time
|
| gptkbp:notation |
P
|
| gptkbp:openProblem |
gptkb:P_vs_NP_problem
|
| gptkbp:relatedTo |
gptkb:co-NP
gptkb:BPP_(complexity_class) gptkb:L_(complexity_class) gptkb:NL_(complexity_class) gptkb:PH_(polynomial_hierarchy) gptkb:RP_(complexity_class) gptkb:ZPP_(complexity_class) |
| gptkbp:studiedIn |
theoretical computer science
|
| gptkbp:bfsParent |
gptkb:P_vs_NP_problem
|
| gptkbp:bfsLayer |
5
|