Ajtai–Komlós–Tusnády theorem
Statement
The Ajtai–Komlós–Tusnády theorem (also known as the AKT optimal matching theorem) is a result in probabilistic combinatorics. Given two random, distinct sets of points and in the unit square , the theorem gives upper and lower bounds for the minimal total distance needed to match the points in one set to those in the other.
Further reading
- Wikipedia, page 79806570, revision 1373512872, Ajtai–Komlós–Tusnády theorem. adopted
About this page
| Tag | N4FHGY5J15 |
|---|---|
| URI | m2://N4FHGY5J15 |
| Aliases | akt-optimal-matching-theorem |
| Kind | statement, proposition |
| Writing | W0 stub |
| Status | This copy of the site has no build data. Run m2 status N4FHGY5J15. |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- edge uses out: each definition that the statement needs (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.