An improved lower bound for approximating shortest integer relation in _ norm (SIR_ )

DOI10.1016/J.IPL.2006.09.005zbMATH Open1185.68850OpenAlexW1585437534MaRDI QIDQ845926FDOQ845926

Authors: Wenbin Chen, Jiangtao Meng 

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.09.005

Recommendations

• On the hardness of approximating shortest integer relations among rational numbers
• scientific article; zbMATH DE number 1114048
• New Hardness Results for Diophantine Approximation
• Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms
• An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\))

zbMATH Keywords

computational complexityapproximation algorithmDiophantine approximationNP-hardhomogeneous linear systeminteger relation

Mathematics Subject Classification ID

Approximation algorithms (68W25) Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Approximating CVP to within almost-polynomial factors is NP-hard
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
• On the hardness of approximating shortest integer relations among rational numbers
• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
• Title not available (Why is that?)

This page was built for publication: An improved lower bound for approximating shortest integer relation in \(\ell _{\infty }\) norm \((SIR_{\infty })\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845926)