Answers are grounded in this paper and cite their sources.
We give an algorithm that finds a sequence of approximations with Dirichlet coefficients bounded by a constant only depending on the dimension. The algorithm uses LLL lattice basis reduction. We present a version of the algorithm that runs in polynomial time of the input.
No takes yet. Share an insight, caveat, or question.
Bosma et al. (2013) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: