Polynomial-time computability
GPTKB entity
Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Computational complexity concept
|
| gptkbp:contrastsWith |
Exponential-time computability
Non-polynomial-time computability |
| gptkbp:defines |
A function or problem is polynomial-time computable if it can be solved by an algorithm whose running time is bounded by a polynomial in the size of the input
|
| https://www.w3.org/2000/01/rdf-schema#label |
Polynomial-time computability
|
| gptkbp:relatedTo |
gptkb:algorithm
P Technical Machine Computational complexity theory |
| gptkbp:usedIn |
gptkb:P_versus_NP_problem
Complexity class definitions |
| gptkbp:bfsParent |
gptkb:Karp_reduction
|
| gptkbp:bfsLayer |
5
|