# A note on polynomial solvability of the CDT problem

arXiv: https://arxiv.org/abs/1406.6429 · HTML: https://mlsanity.com/paper/1406.6429/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 Jun 2014.

## Built on by (most cited first, 2 of 2)

- [Towards optimally abstaining from prediction with OOD test examples](https://mlsanity.com/paper/2105.14119/) (2021)
- [LIBRA: Language Model Informed Bandit Recourse Algorithm for Personalized Treatment Planning](https://mlsanity.com/paper/2601.11905/) (2026)

## Abstract (arXiv)

We describe a simple polynomial-time algorithm for the CDT problem that relies on a construction of Barvinok.