Statements (53)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:abbreviation |
P
|
| gptkbp:contains |
gptkb:language
decision problems linear programming P-complete problems problems like finding shortest paths problems like maximum flow problems like sorting |
| gptkbp:contrastsWith |
gptkb:NP_complexity_class
PSPACE complexity class EXP complexity class |
| gptkbp:definedIn |
theoretical computer science
|
| gptkbp:fullName |
Polynomial time complexity class
|
| gptkbp:hasSubgroup |
gptkb:NP_complexity_class
PSPACE complexity class |
| https://www.w3.org/2000/01/rdf-schema#label |
P complexity class
|
| gptkbp:introduced |
gptkb:John_Hopcroft
gptkb:Jack_Edmonds |
| gptkbp:introducedIn |
1971
|
| gptkbp:isSolvable |
polynomial time
|
| gptkbp:openProblem |
gptkb:P_vs_NP
|
| gptkbp:relatedTo |
gptkb:P/poly_complexity_class
BPP complexity class co-NP complexity class AC complexity class DLOGTIME complexity class EXPTIME complexity class L complexity class NC complexity class NL complexity class P-complete problems PH complexity class RP complexity class ZPP complexity class |
| gptkbp:solvedBy |
deterministic Turing machine
|
| gptkbp:symbol |
P
|
| gptkbp:usedIn |
gptkb:artificial_intelligence
gptkb:complexity_theory gptkb:logic gptkb:machine_learning gptkb:mathematics algorithm analysis automata theory cryptography operations research theoretical computer science optimization graph theory computational theory data structures |
| gptkbp:bfsParent |
gptkb:P_vs_NP_Problem
|
| gptkbp:bfsLayer |
6
|