Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
dynamic programming
|
| gptkbp:citation |
Knuth, D. E., & Yao, A. C. (1975). The complexity of nonuniform random number generation. In Algorithms and Complexity (pp. 357-428).
|
| gptkbp:complexity |
O(n^2)
|
| gptkbp:field |
computer science
algorithm design |
| gptkbp:introducedIn |
1975
|
| gptkbp:namedAfter |
gptkb:Donald_Knuth
gptkb:Andrew_Yao |
| gptkbp:publishedIn |
gptkb:SIAM_Journal_on_Computing
|
| gptkbp:relatedTo |
gptkb:Monge_property
quadrangle inequality |
| gptkbp:solvedBy |
optimal binary search tree problem
|
| gptkbp:usedFor |
speeding up certain dynamic programming recurrences
|
| gptkbp:bfsParent |
gptkb:D._E._Knuth
|
| gptkbp:bfsLayer |
6
|
| http://www.w3.org/2000/01/rdf-schema#label |
Knuth–Yao algorithm
|