Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed

被引：0

|

作者：

Barvinok, Alexander I.

机构：

来源：

Mathematics of Operations Research | 1994年 / 19卷 / 04期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 40 条

[1] A POLYNOMIAL-TIME ALGORITHM FOR COUNTING INTEGRAL POINTS IN POLYHEDRA WHEN THE DIMENSION IS FIXED
BARVINOK, AI
MATHEMATICS OF OPERATIONS RESEARCH, 1994, 19 (04) : 769 - 779
[2] On Barvinok's algorithm for counting lattice points in fixed dimension
Dyer, M
Kannan, R
MATHEMATICS OF OPERATIONS RESEARCH, 1997, 22 (03) : 545 - 549
[3] A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE YOLK IN FIXED DIMENSION
TOVEY, CA
MATHEMATICAL PROGRAMMING, 1992, 57 (02) : 259 - 277
[4] Polynomial-time algorithm for fixed points of nontrivial morphisms
Holub, Stepan
DISCRETE MATHEMATICS, 2009, 309 (16) : 5069 - 5076
[5] A FASTER ALGORITHM FOR COUNTING THE INTEGER POINTS NUMBER IN Δ-MODULAR POLYHEDRA
Gribanov, D., V
Malyshev, D. S.
SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2022, 19 (02): : 613 - 626
[6] The optimal LLL algorithm is still polynomial in fixed dimension
Akhavi, A
THEORETICAL COMPUTER SCIENCE, 2003, 297 (1-3) : 3 - 23
[7] Counting points on hyperelliptic curves in average polynomial time
Harvey, David
ANNALS OF MATHEMATICS, 2014, 179 (02) : 783 - 803
[8] A polynomial algorithm for minimizing discrete convic functions in fixed dimension
Veselov, S., I
Gribanov, D., V
Zolotykh, N. Yu
Chirkov, A. Yu
DISCRETE APPLIED MATHEMATICS, 2020, 283 : 11 - 19
[9] Wasserstein barycenters can be computed in polynomial time in fixed dimension
Altschuler, Jason M.
Boix-Adsera, Enric
Journal of Machine Learning Research, 2021, 22
[10] Wasserstein Barycenters can be Computed in Polynomial Time in Fixed Dimension
Altschuler, Jason M.
Boix-Adsera, Enric
JOURNAL OF MACHINE LEARNING RESEARCH, 2021, 22

← 1 2 3 4 →