On the Hardness of Approximating Shortest Integer Relations Among Rational Numbers
Theoretical Computer Science - Netherlands
doi 10.1016/s0304-3975(97)00118-7
Full Text
Open PDFAbstract
Available in full text
Date
December 1, 1998
Authors
Publisher
Elsevier BV