A note on polynomial solvability of the CDT problem
classification
🧮 math.OC
keywords
problemalgorithmbarvinokconstructiondescribenotepolynomialpolynomial-time
read the original abstract
We describe a simple polynomial-time algorithm for the CDT problem that relies on a construction of Barvinok.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.