{"id":"https://openalex.org/W2150529683","doi":"https://doi.org/10.1137/0214016","title":"The Computational Complexity of Simultaneous Diophantine Approximation Problems","display_name":"The Computational Complexity of Simultaneous Diophantine Approximation Problems","publication_year":1985,"publication_date":"1985-02-01","ids":{"openalex":"https://openalex.org/W2150529683","doi":"https://doi.org/10.1137/0214016","mag":"2150529683"},"language":"en","primary_location":{"id":"doi:10.1137/0214016","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214016","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005612207","display_name":"Jeffrey C. Lagarias","orcid":"https://orcid.org/0000-0002-4157-5527"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. C. Lagarias","raw_affiliation_strings":["AT&T Bell Laboratories, Murray Hill, NJ#TAB#"],"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories, Murray Hill, NJ#TAB#","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005612207"],"corresponding_institution_ids":["https://openalex.org/I1283103587"],"apc_list":null,"apc_paid":null,"fwci":3.6593,"has_fulltext":false,"cited_by_count":198,"citation_normalized_percentile":{"value":0.94272727,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"14","issue":"1","first_page":"196","last_page":"209"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10588","display_name":"Mathematical Dynamics and Fractals","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8356328010559082},{"id":"https://openalex.org/keywords/diophantine-approximation","display_name":"Diophantine approximation","score":0.7981058359146118},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6077211499214172},{"id":"https://openalex.org/keywords/diophantine-equation","display_name":"Diophantine equation","score":0.5760538578033447},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5407161712646484},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.5358784198760986},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5212886333465576},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4750778079032898},{"id":"https://openalex.org/keywords/rational-number","display_name":"Rational number","score":0.4539477825164795},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4333465099334717}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8356328010559082},{"id":"https://openalex.org/C102966492","wikidata":"https://www.wikidata.org/wiki/Q1227061","display_name":"Diophantine approximation","level":3,"score":0.7981058359146118},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6077211499214172},{"id":"https://openalex.org/C206530611","wikidata":"https://www.wikidata.org/wiki/Q905896","display_name":"Diophantine equation","level":2,"score":0.5760538578033447},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5407161712646484},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.5358784198760986},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5212886333465576},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4750778079032898},{"id":"https://openalex.org/C46875033","wikidata":"https://www.wikidata.org/wiki/Q1244890","display_name":"Rational number","level":2,"score":0.4539477825164795},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4333465099334717},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0214016","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214016","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1504382989","https://openalex.org/W1986203294","https://openalex.org/W1991107293","https://openalex.org/W2031206336","https://openalex.org/W2040569180","https://openalex.org/W2047097167","https://openalex.org/W2092636972","https://openalex.org/W2114616381","https://openalex.org/W2141040012","https://openalex.org/W3144959161"],"related_works":["https://openalex.org/W1990667476","https://openalex.org/W4246396013","https://openalex.org/W4247381072","https://openalex.org/W3161824740","https://openalex.org/W2088924374","https://openalex.org/W2963657328","https://openalex.org/W2038265252","https://openalex.org/W2142775997","https://openalex.org/W3143311652","https://openalex.org/W2150529683"],"abstract_inverted_index":{"Simultaneous":[0],"Diophantine":[1,212],"approximation":[2,9,69,138,177,213,237],"in":[3,127,146,190,193,250],"d":[4,25,60,103,147,264],"dimensions":[5,148],"deals":[6],"with":[7,149,178,181,241,247],"the":[8,35,41,65,71,101,175,194,199,220,244,262,278],"of":[10,24,30,44,59,67,79,112,174,198,222,231,238,280],"a":[11,52,77,94,109,136,140,150,166,225,235,251],"vector":[12,54,96,142,227],"${\\bf":[13,97,143,228],"\\alpha":[14],"}":[15],"=":[16],"(\\alpha":[17],"_1":[18],",":[19],"\\cdots":[20],",\\alpha":[21],"_d":[22],")$":[23],"real":[26],"numbers":[27,32,233],"by":[28],"vectors":[29,126],"rational":[31,61,232],"all":[33],"having":[34],"same":[36],"denominator.":[37],"This":[38,187],"paper":[39],"considers":[40],"computational":[42],"complexity":[43,273],"algorithms":[45,86],"to":[46,51,87,93,123,134,139,243,267],"find":[47,88,124,135],"good":[48,137],"simultaneous":[49,211,236,285],"approximations":[50,92,286],"given":[53,95,141,226,252],"$":[55,58,99,145,154,173,230],"{\\bf":[56],"\\alpha}":[57,98,144,229],"numbers.":[62],"We":[63,74,106,202,217,269],"measure":[64],"goodness":[66],"an":[68,128],"using":[70],"sup":[72,89,245],"norm.":[73],"show":[75,107,218],"that":[76,108,208,219,277],"result":[78],"H.":[80,116],"W.":[81,117],"Lenstra,":[82,115,118],"Jr.":[83,119],"produces":[84],"polynomial-time":[85],"norm":[90,246],"best":[91,176,282],"when":[100],"dimension":[102,200,263],"is":[104,164,259,265,287],"fixed.":[105],"recent":[110],"algorithm":[111,188],"A.":[113],"K.":[114],"and":[120],"L.":[121],"Lovasz":[122],"short":[125],"integral":[129],"lattice":[130],"can":[131],"be":[132],"used":[133],"denominator":[151,179,248],"$Q^":[152],"*":[153,159],"satisfying":[155],"$1":[156,182,254],"\\leqq":[157,160,183,185,255,257],"Q^":[158],"2^{d/2}":[161],"N$":[162,258],"which":[163,275],"within":[165],"factor":[167],"$\\sqrt":[168],"{5d}":[169],"2^{(d":[170],"+":[171],"1)/2}":[172],"Q":[180,184,249,256],"N$.":[186],"runs":[189],"time":[191],"polynomial":[192],"input":[195],"size,":[196],"independent":[197],"d.":[201],"also":[203],"prove":[204,270],"complementary":[205],"results":[206],"showing":[207],"certain":[209],"natural":[210],"problems":[214],"are":[215],"NP-hard.":[216],"problem":[221,279],"deciding":[223],"whether":[224],"has":[234],"specified":[239],"accuracy":[240],"respect":[242],"interval":[253],"NP-complete.":[260],"(Here":[261],"allowed":[266],"vary.)":[268],"two":[271],"other":[272],"results,":[274],"suggest":[276],"locating":[281],"(sup":[283],"norm)":[284],"harder":[288],"than":[289],"this":[290],"NP-complete":[291],"problem.":[292]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":16},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}