arXiv · 1707.05941
An Efficient Version of the Bombieri-Vaaler Lemma
Abstract
In their celebrated paper "On Siegel's Lemma", Bombieri and Vaaler found an upper bound on the height of integer solutions of systems of linear Diophantine equations. Calculating the bound directly, however, requires exponential time. In this paper, we present the bound in a different form that can be computed in polynomial time. We also give an elementary (and arguably simpler) proof for the bound.
Explore related subjects
Keep this discovery
Jun Zhang, Qi Cheng. 2017-07-19. An Efficient Version of the Bombieri-Vaaler Lemma. https://arxiv.org/abs/1707.05941
Cite the original work for its findings. Save a collection to share your selection of sources.