Approximating good simultaneous diophantine approximations is almost NP-hard

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

Volumn 1113, Issue , 1996, Pages 494-505

  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; Diophantine approximation; NPhard; Probabilistically checkable proofs

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY;

DIOPHANTINE APPROXIMATION; DISCRETE LOGARITHMS; INTERACTIVE PROOF SYSTEM; NP-HARD; POLYNOMIAL-TIME ALGORITHMS; POSITIVE CONSTANT; PROBABILISTICALLY CHECKABLE PROOF; SIMULTANEOUS DIOPHANTINE APPROXIMATION;

POLYNOMIAL APPROXIMATION;

EID: 84947939293     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61550-4_173     Document Type: Conference Paper

References (19)

1. S. Arora. Probabilistic Checking of Proofs and Hardness of Approximation Problems. Ph.D. thesis, University of California at Berkeley, 1994.
2. 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.
3. S. Arora and C. Lund. Hardness of approximation. In D. Hochbaum (editor), Approximation Algorithms for NP-hard problems, Chapter 11. PWS Publ., 1996.
4. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof verification and hardness of approximation problems. In Proc. 33rd IEEE Symp. on Foundations of Computer Science, pages 14-23, 1992.
5. G. Ausiello, P. Crescenzi and M. Protasi. Approximate solutions of NP optimization problems. Theoretical Computer Science, Volume 150, pages 1-55, 1995.
6. P. Crescenzi and V. Kann. A list of NP-complete optimization problems. Surveys on complexity, Electronic Colloqium on Computational Complexity, http://www.informatik.uni-trier.de/eccc/, 1996.
7. 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.
8. A. Frank and É. Tardos. An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica, Volume 7, pages 49-65, 1987.
9. D. R. Heath-Brown. The number of primes in a short interval. J. reine angew. Math., Volume 389, pages 22-63, 1988.
10. D. R. Heath-Brown and H. Iwaniec. On the difference between consecutive primes. Inventiones math., Volume 55, pages 49-69, 1979.
11. R. Kannan, A. K. Lenstra and L. Lovász. Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers. Math. Comp., Volume 50, pages 235-250, 1988.
12. J. C. Lagarias. The computational complexity of simultaneous diophantine approximation problems. SIAM J. Comput., Volume 14, pages 196-209, 1985.
13. 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.
14. R. Raz. A parallel repetition theorem. In Proc. 27th ACM Symp. Theory of Computing, pages 447-456, 1995.
15. C. Rössner and J.-P. Seifert. The complexity of approximate optima for greatest common divisor computations. In Proc. 2nd Algorithmic Number Theory Symposium, pages ?-? Springer, 1996. LNCS.
16. C. Rössner and J.-P. Seifert. On the hardness of approximating shortest integer relations among rational numbers. In Proc. CATS’96 (Computing: The Australasian Theory Symposium), pages 180-186, 1996.
17. C. P. Schnorr. Factoring integers and computing discrete logarithms via diophantine approximations. AMS DIM ACS Series in Disc. Math, and Theoretical Comp. Science, Volume 13, pages 171-181, 1993.
18. A. Schoenhage. Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm. In 11th ICALP, pages 436-447. Springer, 1987. LNCS 172.
19. 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.