Refined upper bounds for the linear Diophantine problem of Frobenius
From MaRDI portal
Publication:1883402
DOI10.1016/S0196-8858(03)00055-1zbMath1055.11021arXivmath/0305420OpenAlexW2025638185WikidataQ59448326 ScholiaQ59448326MaRDI QIDQ1883402
Shelemyahu Zacks, Matthias Beck
Publication date: 12 October 2004
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0305420
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On the linear diophantine problem of Frobenius
- The Frobenius problem, rational polytopes, and Fourier-Dedekind sums
- A Linear Diophantine Problem
- Bounds for a Linear Diophantine Problem of Frobenius
- On the linear diophantine problem of Frobenius.
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Some Experimental Results on the Frobenius Problem
- Some remarks on certain generalized Dedekind sums
- On a linear diophantine problem of Frobenius
This page was built for publication: Refined upper bounds for the linear Diophantine problem of Frobenius