Statements (52)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:characterizedBy |
deterministic Turing machine
polynomial time algorithm |
| gptkbp:complement |
co-P
|
| gptkbp:contains |
decision problems solvable in polynomial time
|
| gptkbp:contrastsWith |
gptkb:EXPTIME
gptkb:NP-hard NP-complete |
| gptkbp:definedIn |
theoretical computer science
|
| gptkbp:example |
gptkb:shortest_path_problem
sorting linear programming maximum flow problem primality testing bipartite matching |
| gptkbp:hasProperty |
closed under concatenation
closed under Kleene star closed under homomorphism closed under intersection closed under inverse homomorphism closed under reversal closed under union closed under complement closed under projection closed under quotient closed under regular operations closed under substitution robust under Turing reductions robust under bounded truth-table reductions robust under conjunctive reductions robust under disjunctive reductions robust under logspace reductions robust under many-one reductions robust under polynomial-time reductions robust under truth-table reductions |
| gptkbp:hasSubgroup |
gptkb:PSPACE
NP |
| https://www.w3.org/2000/01/rdf-schema#label |
P (polynomial time)
|
| gptkbp:introduced |
gptkb:John_Nash
gptkb:Jack_Edmonds |
| gptkbp:introducedIn |
1960s
|
| gptkbp:notation |
P
|
| gptkbp:openProblem |
gptkb:P_vs_NP_problem
|
| gptkbp:relatedTo |
gptkb:BPP
gptkb:ZPP L (logarithmic space) NC (Nick's Class) PH (Polynomial Hierarchy) RP (Randomized Polynomial Time) |
| gptkbp:symbol |
P
|
| gptkbp:bfsParent |
gptkb:NP_(nondeterministic_polynomial_time)
|
| gptkbp:bfsLayer |
6
|