The problem of computing the width of simplices generated by the convex hull of their integer vertices is considered. An FPT algorithm, in which the parameter is the maximum absolute value of the rank minors of the matrix consisting from the simplex vertices, is presented.

中文翻译：

---

用于计算由凸包给出的单形宽度的FPT算法

考虑了计算由整数顶点的凸包生成的单纯形的宽度的问题。提出了一种FPT算法，其中参数是由单纯形顶点组成的矩阵的秩次幂的最大绝对值。