메뉴 건너뛰기
Information Processing Letters
Volumn 101, Issue 4, 2007, Pages 174-179
An improved lower bound for approximating Shortest Integer Relation in ℓ∞ norm (SIR∞)
Author keywords

Approximation algorithm; Computational complexity; Diophantine approximation; Homogeneous linear system; Integer relation; NP hard
Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; NUMBER THEORY; THEOREM PROVING; VECTORS;
EID: 33845495847     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.09.005     Document Type: Article
Times cited : (5)
References (8)
  • 2
    • 84912137975 scopus 로고    scopus 로고
    • ∞ to within almost-polynomial factors is NP-hard
    • Proc. of the 4th Italian Conference on algorithms and Complexity, Springer, Berlin
    • ∞ to within almost-polynomial factors is NP-hard. Proc. of the 4th Italian Conference on algorithms and Complexity. Lecture Notes in Comput. Sci. vol. 1767 (2000), Springer, Berlin
    • (2000) Lecture Notes in Comput. Sci. , vol.1767
    • Dinur, I.1
  • 3
    • 0024748719 scopus 로고
    • Polynomial time algorithms for finding integer relations among real numbers
    • Håstad J., Just B., Lagarias J.C., and Schnorr C.P. Polynomial time algorithms for finding integer relations among real numbers. SIAM J. Comput. 18 (1989) 859-881
    • (1989) SIAM J. Comput. , vol.18 , pp. 859-881
    • Håstad, J.1    Just, B.2    Lagarias, J.C.3    Schnorr, C.P.4
  • 4
    • 0007513183 scopus 로고
    • Polynomial factorization and nonrandomness of bits of algebraic and transcendental numbers
    • Kannan R., Lenstra A.K., and Lovász L. Polynomial factorization and nonrandomness of bits of algebraic and transcendental numbers. Math. Comp. 50 (1988) 235-250
    • (1988) Math. Comp. , vol.50 , pp. 235-250
    • Kannan, R.1    Lenstra, A.K.2    Lovász, L.3
  • 5
    • 0022012583 scopus 로고
    • The computational complexity of simultaneous diophantine approximation problems
    • Lagarias J.C. The computational complexity of simultaneous diophantine approximation problems. SIAM J. Comput. 14 (1985) 196-209
    • (1985) SIAM J. Comput. , vol.14 , pp. 196-209
    • Lagarias, J.C.1
  • 6
    • 0347128744 scopus 로고    scopus 로고
    • On the hardness of approximating shortest integer relations among rational numbers
    • Rössner C., and Seifert J.P. On the hardness of approximating shortest integer relations among rational numbers. Theoret. Comput. Sci. 209 1-2 (1998) 287-297
    • (1998) Theoret. Comput. Sci. , vol.209 , Issue.1-2 , pp. 287-297
    • Rössner, C.1    Seifert, J.P.2
  • 7
    • 84947939293 scopus 로고    scopus 로고
    • Approximating good simultaneous diophantine approximations is almost NP-hard
    • 21st International Symposium on Mathematical Foundations of Computer Science (MFCS'96), Springer, Berlin
    • Rössner C., and Seifert J.P. Approximating good simultaneous diophantine approximations is almost NP-hard. 21st International Symposium on Mathematical Foundations of Computer Science (MFCS'96). Lecture Notes in Comput. Sci. (1996), Springer, Berlin 494-505
    • (1996) Lecture Notes in Comput. Sci. , pp. 494-505
    • Rössner, C.1    Seifert, J.P.2
  • 8
    • 33845488941 scopus 로고    scopus 로고
    • P. van Emde Boas, Another NP-complete problem and the complexity of computing short vectors in a lattice, Tech. Report 81-04, Mathematische Institut Univ. of Amsterdam, 1981

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.