Statements (11)
Predicate | Object |
---|---|
gptkbp:instanceOf |
gptkb:mathematical_concept
|
gptkbp:definedIn |
lim_{n→∞} (E(L_n) - 2√n + R) = 0, where L_n is the length of the longest increasing subsequence in a random permutation of n elements
|
gptkbp:estimatedCost |
0.6617071822
|
https://www.w3.org/2000/01/rdf-schema#label |
Robbins constant
|
gptkbp:namedAfter |
gptkb:Herbert_Robbins
|
gptkbp:originatedIn |
gptkb:probability_theory
combinatorics asymptotics of the expected length of the longest increasing subsequence in a random permutation |
gptkbp:symbol |
R
|
gptkbp:bfsParent |
gptkb:David_P._Robbins
|
gptkbp:bfsLayer |
5
|