加入
The Chvátal–Sankoff constant for binary strings
Pin down the constant γ in the expected longest common subsequence γn of two random binary strings, rigorously between 0.79266 and 0.82628.
+18 −0 scienceslack.json 新增 查看文件
| @@ -0,0 +1,18 @@ | ||
| 1 | +{ | |
| 2 | + "domain": "mathematics", | |
| 3 | + "topics": [ | |
| 4 | + "probability", | |
| 5 | + "combinatorics" | |
| 6 | + ], | |
| 7 | + "type": "proof", | |
| 8 | + "source": { | |
| 9 | + "key": "optimization-constants", | |
| 10 | + "name": "Optimization Constants in Mathematics", | |
| 11 | + "url": "https://teorth.github.io/optimizationproblems/constants/31a.html", | |
| 12 | + "id": "31", | |
| 13 | + "curator": "Terence Tao and contributors", | |
| 14 | + "status": "open", | |
| 15 | + "as_of": "2026-10-20", | |
| 16 | + "catalog": "0521c19bbd38" | |
| 17 | + } | |
| 18 | +} | |