Advertisement

The complexity of approximate optima for greatest common divisor computations

  • Carsten Rössner
  • Jean-Pierre Seifert
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1122)

Abstract

We study the approximability of the following NP-complete (in their feasibility recognition forms) number theoretic optimization problems:

  1. 1.

    Given n numbers a1,..., a n ∈ z, find a minimum gcd set for a1,..., a n , i.e., a subset S\(\subseteq \){a1,..., a n } with minimum cardinality satisfying gcd(S)=gcd(a1,..., a n ).

     
  2. 2.

    Given n numbers a1,..., a n z, find a ℓ-minimum gcd multiplier for a1,..., a n , i.e., a vector x ∈ zn with minimum max1≤in ¦xi¦ satisfying ∑ i=1 n x i a i =gcd (a1, ..., a n ).

     

We present a polynomial-time algorithm which approximates a minimum gcd set for a1,..., a n within a factor 1+ln n and prove that this algorithm is best possible in the sense that unless NP\(\subseteq \)DTIME(nO(log log n)), there is no polynomial-time algorithm which approximates a minimum gcd set within a factor (1-o(1))In n.

Concerning the second problem, we prove under the slightly stronger complexity theory assumption, NP\(\nsubseteq \)DTIME(npoly(log n)), that there is no polynomial-time algorithm which approximates a ℓ-minimum gcd multiplier within a factor \(2^{\log ^{1 - \gamma } n} \), where γ is an arbitrary small positive constant.

Complementary to this result, there exists a polynomial-time algorithm, which computes a gcd multiplier xzn for a1,..., anz with ∥xt8 ≤ 0.5 ∥at8. In this paper, we also present a simple polynomial-time algorithm which computes a gcd multiplier xzn with Euclidean length ∥x∥≤1.5na∥/gcd(a1,..., a n ).

Our inapproximability results rely on gap-preserving reductions from minimization problems with equal inapproximability ratios. We implicitly use the close connection between the hardness of approximation and the theory of interactive proof systems, particularly the work of [3, 8, 16, 13].

Key Words

Approximation algorithm computational complexity gcd label cover NP-hard number theoretic problems probabilistically checkable proofs 2-prover 1-round interactive proof systems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. M. Anthonisse. A note on equivalent systems of linear diophantine equations. Z. Operations Research, Volume 17, pages 167–177, 1973.Google Scholar
  2. 2.
    S. Arora. Probabilistic Checking of Proofs and Hardness of Approximation Problems. Ph.D. thesis, University of California at Berkeley, 1994.Google Scholar
  3. 3.
    S. Arora, L. Babai, J. Stern and Z Sweedyk. The hardness of approximate optima in lattices, codes and systems of linear equations. In Proc. 34th IEEE Symp. on Foundations of Computer Science, pages 724–730, 1993.Google Scholar
  4. 4.
    S. Arora and C. Lund. Hardness of approximation. In D. Hochbaum (editor), Approximation Algorithms for NP-hard Problems, Chapter 11. PWS Publishing, 1996.Google Scholar
  5. 5.
    G. Ausiello, P. Crescenzi and M. Protasi. Approximate solutions of NP optimization problems. Theoretical Computer Science, Volume 150, pages 1–55, 1995.Google Scholar
  6. 6.
    V. Chvatal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, Volume 4, pages 233–235, 1978.Google Scholar
  7. 7.
    U. Feige. A threshold of In n for approximating set cover. In Proc. 28th ACM Symp. Theory of Computing, 1996.Google Scholar
  8. 8.
    U. Feige and L. Lovász. Two-prover one-round proof systems: Their power and their problems. In Proc. 24th ACM Symp. Theory of Computing, pages 643–654, 1992.Google Scholar
  9. 9.
    J. Håstad, B. Just, J. C. Lagarias and C. P. Schnorr. Polynomial time algorithms for finding integer relations among real numbers. SIAM J. Computation, Volume 18, pages 859–881, 1989.Google Scholar
  10. 10.
    D. S. Johnson. Approximation algorithms for combinatorial algorithms. J. CSS, Volume 9, pages 256–278, 1974.Google Scholar
  11. 11.
    R. Kannan. Polynomial-time aggregation of integer programming problems. J. ACM, Volume 30, pages 133–145, 1983.Google Scholar
  12. 12.
    R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher (editors), Complexity of Computer Computations. Plenum Press, New York, 1972.Google Scholar
  13. 13.
    C. Lund and M. Yannakakis. On the hardness of minimization problems. J. ACM, Volume 41, pages 960–981, 1994.Google Scholar
  14. 14.
    F. J. Mac Williams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North Holland, Amsterdam, 1977.Google Scholar
  15. 15.
    B. S. Majewski and G. Havas. The complexity of greatest common divisor computations. In Proc. 1st International Symposium on Algorithmic Number Theory, pages 184–193. Springer, 1994. LNCS 877.Google Scholar
  16. 16.
    R. Raz. A parallel repetition theorem. In Proc. 27th ACM Symp. Theory of Computing, pages 447–456, 1995.Google Scholar
  17. 17.
    P. van Emde Boas. Another NP-complete partition problem and the complexity of computing short vectors in a lattice. Technical Report 81-04, Math. Inst., University of Amsterdam, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Carsten Rössner
    • 1
  • Jean-Pierre Seifert
    • 1
  1. 1.Dept. of Math. Comp. ScienceUniversity of FrankfurtFrankfurt/MainGermany

Personalised recommendations