D. S. Malyshev

collaborators

2 papers

cs.CC2022

Structured $(min, +)$ -Convolution And Its Applications For The Shortest Vector, Closest Vector, and Separable Nonlinear Knapsack Problems

D. V. Gribanov, I. A. Shumilov, D. S. Malyshev

In this work we consider the problem of computing the $(min, +)$ -convolution of two sequences $a$ and $b$ of lengths $n$ and $m$ , respectively, where $n \geq m$ . We assume that $a…

cs.CC2021

A faster algorithm for counting the integer points number in $Δ$ -modular polyhedra (corrected version)

D. V. Gribanov, D. S. Malyshev

Let a polytope $P$ be defined by a system $A x \leq b$ . We consider the problem of counting the number of integer points inside $P$ , assuming that $P$ is $Δ$ -modular, where the pol…

Structured (min,+)-Convolution And Its Applications For The Shortest Vector, Closest Vector, and Separable Nonlinear Knapsack Problems

A faster algorithm for counting the integer points number in Δ-modular polyhedra (corrected version)

Structured $(min, +)$ -Convolution And Its Applications For The Shortest Vector, Closest Vector, and Separable Nonlinear Knapsack Problems

A faster algorithm for counting the integer points number in $Δ$ -modular polyhedra (corrected version)