Thomas Rothvoss

activity

20242026

most citedThe Subspace Flatness Conjecture and Faster Integer Programming

1 citations · 1 across the 2 of their papers we have counts for

collaborators

Showing math.OCShow all

2 papers · 1 filter

math.OC2026★ 1 cited

The Subspace Flatness Conjecture and Faster Integer Programming

Victor Reis, Thomas Rothvoss

In a seminal paper, Kannan and LovÃ¡sz (1988) considered a quantity $I^¼_{K L} (I^, K)$ which denotes the best volume-based lower bound on the covering radius $I^¼ (I^, K)$ of a convex bo…

math.OC2024

Forall-exist statements in pseudopolynomial time

Eleonore Bach, Friedrich Eisenbrand, Thomas Rothvoss +1

Given a convex set $Q \subseteq R^{m}$ and an integer matrix $W \in Z^{m \times n}$ , we consider statements of the form $\forall b \in Q \cap Z^{m}$ $\exists x \in Z^{n}$ s.t. $Wx \leq…