{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T20:47:51Z","timestamp":1790887671160,"version":"4.1.0"},"reference-count":22,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,2]]},"abstract":"<jats:p>Simultaneous Diophantine approximation in d dimensions deals with the approximation of a vector ${\\bf \\alpha } = (\\alpha _1 , \\cdots ,\\alpha _d )$ of d real numbers by vectors of rational numbers all having the same denominator. This paper considers the computational complexity of algorithms to find good simultaneous approximations to a given vector $ {\\bf \\alpha} $ of d rational numbers. We measure the goodness of an approximation using the sup norm. We show that a result of H. W. Lenstra, Jr. produces polynomial-time algorithms to find sup norm best approximations to a given vector ${\\bf \\alpha} $ when the dimension d is fixed. We show that a recent algorithm of A. K. Lenstra, H. W. Lenstra, Jr. and L. Lovasz to find short vectors in an integral lattice can be used to find a good approximation to a given vector ${\\bf \\alpha} $ in d dimensions with a denominator $Q^ * $ satisfying $1 \\leqq Q^ * \\leqq 2^{d\/2} N$ which is within a factor $\\sqrt {5d} 2^{(d + 1)\/2} $ of the best approximation with denominator Q with $1 \\leqq Q \\leqq N$. This algorithm runs in time polynomial in the input size, independent of the dimension d.<\/jats:p>\n                  <jats:p>We also prove complementary results showing that certain natural simultaneous Diophantine approximation problems are NP-hard. We show that the problem of deciding whether a given vector ${\\bf \\alpha} $ of rational numbers has a simultaneous approximation of specified accuracy with respect to the sup norm with denominator Q in a given interval $1 \\leqq Q \\leqq N$ is NP-complete. (Here the dimension d is allowed to vary.) We prove two other complexity results, which suggest that the problem of locating best (sup norm) simultaneous approximations is harder than this NP-complete problem.<\/jats:p>","DOI":"10.1137\/0214016","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"196-209","source":"Crossref","is-referenced-by-count":125,"title":["The Computational Complexity of Simultaneous Diophantine Approximation Problems"],"prefix":"10.1137","volume":"14","author":[{"given":"J. C.","family":"Lagarias","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","unstructured":"L. M. Adleman, R. L. Rivest,  How to break the Lu\u2013Lee (COMSAT) public-key cryptosystem, MIT Laboratory for Computer Science, Cambridge, MA,  1979, July"},{"key":"R2","first-page":"18","volume":"326","author":"Brentjes A.","year":"1981","journal-title":"J. Reine Angew. Math."},{"key":"R3","unstructured":"P. van Emde Boas,  Another NP-complete partition problem and the complexity of computing short vectors in a lattice, Report, 81\u201304, Math. Dept., Univ. Amsterdam,  1981, April"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-1979-14691-3"},{"key":"R5","volume-title":"Computers and intractability","author":"Garey Michael R.","year":"1979"},{"key":"R6","first-page":"301","volume":"35","author":"Goethals J.-M.","year":"1980","journal-title":"Philips J. Res."},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02139702"},{"key":"R8","unstructured":"G. Hoheisel, Primzahlprobleme in der Analysis, Vol. 33, Sitz. Preuss. Akad. Wiss., 1930, 3\u20131156.0172.02"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90016-X"},{"key":"R10","unstructured":"J. C. Lagarias,  P.  Ribenboim,  Some new results in simultaneous Diophantine approximation,  Proc. the Queen's Number Theory Conference 1979, Queen's Papers in Pure and Apilied Mathematics, Vol. 54,  1980,  453\u2013474"},{"key":"R11","first-page":"545","volume":"272","author":"Lagarias J. C.","year":"1982","journal-title":"Trans. Amer. Math. Soc."},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-4730-9_1"},{"key":"R13","unstructured":"E. W. Leggett, Jr., Ph.D. Thesis,  Tools and techniques for classifying NP-complete problems, Dept. Computer and Information Sciences, Ohio State Univ., Columbus, OH,  1977"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.4.538"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90044-2"},{"key":"R17","unstructured":"A. Paz,  Generating best approximations of vectors of real numbers with a preassigned tolerance, preprint"},{"key":"R18","first-page":"42","volume":"2","author":"Rubin A.","year":"1981","journal-title":"Abstracts of the A.M.S."},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804405"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.5"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056197"},{"key":"R22","unstructured":"H. Zassenhaus,  A new polynomial factorization algorithm,  1981, unpublished manuscript"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214016","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:42:24Z","timestamp":1787337744000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214016"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,2]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,2]]}},"alternative-id":["10.1137\/0214016"],"URL":"https:\/\/doi.org\/10.1137\/0214016","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,2]]}}}