A note on polynomial solvability of the CDT problem
Abstract
We describe a simple polynomial-time algorithm for the CDT problem that relies on a construction of Barvinok.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.