A note on polynomial solvability of the CDT problem

preprint2015arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.