The Complexity of Vector Partition
From MaRDI portal
Publication:6377623
DOI10.1007/S10013-021-00523-6arXiv2109.06569MaRDI QIDQ6377623
Publication date: 14 September 2021
Algorithms in computer science (68Wxx) Discrete geometry (52Cxx) Integer programming (90C10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Multivariate analysis (62Hxx) Basic linear algebra (15Axx) General convexity (52Axx) Real and complex geometry (51Mxx) Parameterized complexity, tractability and kernelization (68Q27) Computing methodologies and applications (68Uxx) Polytopes and polyhedra (52Bxx)
This page was built for publication: The Complexity of Vector Partition