5 ms·
I didn't know about his inequalities, but I found (1) that provides an example of using Talagrand inequality applied to the longest increasing subsequence pr
by bruturis 2y ago
I didn't know about his inequalities, but I found (1) that provides an example of using Talagrand inequality applied to the longest increasing subsequence problem (12 pages, easy to read). It seems to be a broad generalization of the Hamming distance.
(1) https://www.cs.purdue.edu/homes/hmaji/teaching/Spring%202018/lectures/11.pdf https://www.cs.purdue.edu/homes/hmaji/teaching/Spring%202018...
- anthk 2y agoI was about to say that. Also, check out this http://doc.9gridchan.info/blog/181230.ncubic.routing http://doc.9gridchan.info/blog/181230.ncubic.routing http://doc.9gridchan.info/blog/190104.ncubic.algorithms http://doc.9gridchan.info/blog/190104.ncubic.algorithms Fromm mycrovtif (RIP), a guy from the plan9/9front community.