### On the Hardness of Approximating Shortest Integer Relations among Rational Numbers

Carsten R\H{o}ssner
Department of Mathematical Computer Science, University of Frankfurt, P.O. Box 11 19 32, 60054 Frankfurt on the Main, Germany
roessner@cs.uni-frankfurt.de

Jean-Pierre Seifert
Department of Mathematical Computer Science, University of Frankfurt, P.O. Box 11 19 32, 60054 Frankfurt on the Main, Germany
seifert@cs.uni-frankfurt.de