A note on polynomial solvability of the CDT problem
Optimization and Control
2015-02-24 v6
Authors:
Daniel Bienstock
Abstract
We describe a simple polynomial-time algorithm for the CDT problem that relies on a construction of Barvinok.
Keywords
Cite
@article{arxiv.1406.6429,
title = {A note on polynomial solvability of the CDT problem},
author = {Daniel Bienstock},
journal= {arXiv preprint arXiv:1406.6429},
year = {2015}
}
Related papers
View all related →
Computational Complexity · Computer Science
Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity
Chee-Khian Sim
2025-12-24
Computational Complexity · Computer Science
The 3-satisfiability problem
Amar Mukherjee
2012-01-09
Combinatorics · Mathematics
Approximating the volume of a truncated relaxation of the independence polytope
Ferenc Bencs, Guus Regts
2024-04-15
Combinatorics · Mathematics
A polynomial time algorithm for calculating Fourier-Dedekind sums
Guoce Xin, Xinyu Xu
2023-03-03
Computational Complexity · Computer Science
Complexity of the CNF-satisfiability problem
Grigoriy V. Bokov
2018-07-23
Computational Complexity · Computer Science
Polynomial Time Algorithm for Boolean Satisfiability Problem
Stepan G. Margaryan
2023-11-01
Optimization and Control · Mathematics
Short Rational Generating Functions For Multiobjective Linear Integer Programming
Victor Blanco, Justo Puerto
2008-03-04
Computational Complexity · Computer Science
On solving systems of diagonal polynomial equations over finite fields
Gabor Ivanyos, Miklos Santha
2016-06-09
Optimization and Control · Mathematics
A polynomially solvable case of the pooling problem
Natashia Boland, Thomas Kalinowski, Fabian Rigterink
2017-02-09
Quantum Physics · Physics
Quantum algorithms for solvable groups
John Watrous
2007-05-23
Computational Complexity · Computer Science
Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem
Christopher Clingerman, Jeremiah Hemphill, Corey Proscia
2008-01-04
Discrete Mathematics · Computer Science
Injectivity of polynomials over finite discrete dynamical systems
Antonio E. Porreca, Marius Rolland
2026-04-10
Quantum Physics · Physics
A Quantum Polynomial-Time Solution to The Dihedral Hidden Subgroup Problem
Matthew Moore, Grace Young
2022-02-24
Computational Geometry · Computer Science
Minkowski Sum of Polytopes Defined by Their Vertices
Vincent Delos, Denis Teissandier
2015-06-17
Data Structures and Algorithms · Computer Science
Algorithms and Complexity for Variants of Covariates Fine Balance
Dorit S. Hochbaum, Asaf Levin, Xu Rao
2020-09-18
Data Structures and Algorithms · Computer Science
Determining satisfiability of 3-SAT in polynomial time
Ortho Flint, Asanka Wickramasinghe, Jason Brasse, Christopher Fowler
2020-07-02
Computational Complexity · Computer Science
A Proof of the CSP Dichotomy Conjecture
Dmitriy Zhuk
2020-10-05
Data Structures and Algorithms · Computer Science
Polynomial-Time Approximation of Zero-Free Partition Functions
Penghui Yao, Yitong Yin, Xinyuan Zhang
2022-02-01
Quantum Physics · Physics
A Polynomial-Time Quantum Algorithm for Collision Problem
Dong Pyo Chi, Jinsoo Kim
2008-02-03
Strongly Correlated Electrons · Physics
A polynomial-time algorithm for the ground state of one-dimensional gapped Hamiltonians
Yichen Huang
2015-10-27
Combinatorics · Mathematics
Barvinok's Rational Functions: Algorithms and Applications to Optimization, Statistics, and Algebra
Ruriko Yoshida
2007-06-13
Discrete Mathematics · Computer Science
A Polynomial Time Algorithm for The Traveling Salesman Problem
Sergey Gubin
2008-11-10
Artificial Intelligence · Computer Science
Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits
Pierre Bourhis, Laurence Duchien, Jérémie Dusart, Emmanuel Lonca +2
2022-05-09
Combinatorics · Mathematics
Decomposition of polytopes and polynomials
S. Gao, A. G. B. Lauder
2007-05-23
Quantum Physics · Physics
A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space
Oded Regev
2007-05-23