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

Carsten Rössner Jean-Pierre Seifert

Published in: Theor. Comput. Sci. (1998)

Keyphrases

real numbers
phase transition
computational complexity
shortest path
spatial relations
information retrieval
artificial intelligence
np complete
learning theory
minimum cost flow