The Complexity of the Extended GCD Problem

@inproceedings{Havas1999TheCO,
  title={The Complexity of the Extended GCD Problem},
  author={George Havas and Jean-Pierre Seifert},
  booktitle={MFCS},
  year={1999}
}
We undertake a thorough complexity study of the following fundamental optimization problem, known as the `p-norm shortest extended GCD multiplier problem: given a1, . . . , an ∈ Z, find an `p-norm shortest gcd multiplier for a1, . . . , an, i.e., a vector x ∈ Z with minimum ( ∑n i=1 |xi|) satisfying ∑n i=1 xiai = gcd(a1, . . . , an). First, we prove that the shortest GCD multiplier problem (in its feasibility recognition form) is NP-complete for every `p-norm with p ∈ N. This gives an… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Sudan and L . Trevisan . Constraint Satisfaction : The Approximability of Minimization Problems

  • M. Yannakakis
  • Proceedings of the 12 th IEEE Conference on…
  • 1997