An improved lower bound for approximating minimum GCD multiplier in ℓ∞ norm (GCDM∞)

WenBin Chen, Jiangtao Meng, Dengpan Yin
2008 Theoretical Computer Science  
In this paper, we study the inapproximability of the following NP-complete number theoretic optimization problems introduced by Rössner and Seifert [C. Rössner, J.P. Seifert, The complexity of approximate optima for greatest common divisor computations, in:
doi:10.1016/j.tcs.2007.09.030 fatcat:3rlduk6bo5bz7g7fqfhfmaong4