The complexity of approximate optima for greatest common divisor computations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1122, Issue , 1996, Pages 307-322

  Rössner, Carsten ^a   Seifert, Jean Pierre ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

2 prover 1 round interactive proof systems; Approximation algorithm; Computational complexity; Gcd; Label cover; NP hard; Number theoretic problems; Probabilistically checkable proofs

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; NUMBER THEORY; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

GREATEST COMMON DIVISORS; HARDNESS OF APPROXIMATION; INTERACTIVE PROOF SYSTEM; NP-HARD; NUMBER THEORETIC PROBLEMS; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME ALGORITHMS; PROBABILISTICALLY CHECKABLE PROOF;

OPTIMIZATION;

EID: 0010135347     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61581-4_64     Document Type: Conference Paper

References (17)

1. J. M. Anthonisse. A note on equivalent systems of linear diophantine equations. Z. Operations Research, Volume 17, pages 167-177, 1973.
2. S. Arora. Probabilistic Checking of Proofs and Hardness of Approximation Problems. Ph.D. thesis, University of California at Berkeley, 1994.
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 Syrup. on Foundations of Computer Science, pages 724-730, 1993.
4. S. Arora and C. Lund. Hardness of approximation. In D. Hochbaum (editor), Approximation Algorithms for NP-hard Problems, Chapter 11. PWS Publishing, 1996.
5. G. Ausiello, P. Crescenzi and M. Protasi. Approximate solutions of NP optimization problems. Theoretical Computer Science, Volume 150, pages 1-55, 1995.
6. V. Chvatal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, Volume 4, pages 233-235, 1978.
7. U. Feige. A threshold of lnn for approximating set cover. In Proc. 28th ACM Syrup. Theory of Computing, 1996.
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.
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.
10. D. S. Johnson. Approximation algorithms for combinatorial algorithms. J. CSS, Volume 9, pages 256-278, 1974.
11. R. Kannan. Polynomial-time aggregation of integer programming problems. J. ACM, Volume 30, pages 133-145, 1983.
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.
13. C. Lund and M. Yannakakis. On the hardness of minimization problems. J. ACM, Volume 41, pages 960-981, 1994.
14. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North Holland, Amsterdam, 1977.
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.
16. R. Raz. A parallel repetition theorem. In Proc. 27th ACM Syrup. Theory of Computing, pages 447-456, 1995.
17. P. van Erode 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.