A note on polynomial solvability of the CDT problem
Not on the map. Why?
Abstract (arXiv)
We describe a simple polynomial-time algorithm for the CDT problem that relies on a construction of Barvinok.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 25 Jun 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 0; 2025: 0; 2026: 1.
2 papers.