{"id":"https://openalex.org/W1976899945","doi":"https://doi.org/10.1137/0218046","title":"Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations","display_name":"Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations","publication_year":1989,"publication_date":"1989-08-01","ids":{"openalex":"https://openalex.org/W1976899945","doi":"https://doi.org/10.1137/0218046","mag":"1976899945"},"language":"en","primary_location":{"id":"doi:10.1137/0218046","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218046","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/A5058155947","display_name":"Costas S. Iliopoulos","orcid":"https://orcid.org/0000-0003-3909-0077"},"institutions":[{"id":"https://openalex.org/I124357947","display_name":"University of London","ror":"https://ror.org/04cw6st05","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Costas S. Iliopoulos","raw_affiliation_strings":["(University of London, Egham, UK)"],"affiliations":[{"raw_affiliation_string":"(University of London, Egham, UK)","institution_ids":["https://openalex.org/I124357947"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5058155947"],"corresponding_institution_ids":["https://openalex.org/I124357947"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.09863365,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"18","issue":"4","first_page":"670","last_page":"678"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9854999780654907,"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.9854999780654907,"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/T12069","display_name":"Commutative Algebra and Its Applications","score":0.9836000204086304,"subfield":{"id":"https://openalex.org/subfields/2602","display_name":"Algebra and Number Theory"},"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9491000175476074,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/diophantine-equation","display_name":"Diophantine equation","score":0.8669945001602173},{"id":"https://openalex.org/keywords/abelian-group","display_name":"Abelian group","score":0.5933923125267029},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5870546698570251},{"id":"https://openalex.org/keywords/cornacchias-algorithm","display_name":"Cornacchia's algorithm","score":0.5475729703903198},{"id":"https://openalex.org/keywords/diophantine-set","display_name":"Diophantine set","score":0.47123536467552185},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4560965299606323},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.436244398355484},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40925610065460205},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.35501372814178467},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32829850912094116},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.19477912783622742},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.07021722197532654}],"concepts":[{"id":"https://openalex.org/C206530611","wikidata":"https://www.wikidata.org/wiki/Q905896","display_name":"Diophantine equation","level":2,"score":0.8669945001602173},{"id":"https://openalex.org/C136170076","wikidata":"https://www.wikidata.org/wiki/Q181296","display_name":"Abelian group","level":2,"score":0.5933923125267029},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5870546698570251},{"id":"https://openalex.org/C98059654","wikidata":"https://www.wikidata.org/wiki/Q5171072","display_name":"Cornacchia's algorithm","level":4,"score":0.5475729703903198},{"id":"https://openalex.org/C40621787","wikidata":"https://www.wikidata.org/wiki/Q16251580","display_name":"Diophantine set","level":3,"score":0.47123536467552185},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4560965299606323},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.436244398355484},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40925610065460205},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.35501372814178467},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32829850912094116},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.19477912783622742},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.07021722197532654},{"id":"https://openalex.org/C75930677","wikidata":"https://www.wikidata.org/wiki/Q1251950","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0218046","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218046","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"},{"id":"pmh:oai:wrap.warwick.ac.uk:121410","is_oa":false,"landing_page_url":"http://wrap.warwick.ac.uk/121410/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2015161630","https://openalex.org/W2032980094","https://openalex.org/W2035476608","https://openalex.org/W2250444211","https://openalex.org/W4236069311"],"related_works":["https://openalex.org/W2019242178","https://openalex.org/W2110759722","https://openalex.org/W1799780713","https://openalex.org/W2795416216","https://openalex.org/W3021675777","https://openalex.org/W2016416448","https://openalex.org/W4385266593","https://openalex.org/W2091550507","https://openalex.org/W1997777319","https://openalex.org/W2253817964"],"abstract_inverted_index":{"An":[0],"$O(s^5":[1],"M(s^2":[2],"))$":[3,50],"elementary":[4,51],"operations":[5],"algorithm":[6,29],"for":[7,30],"computing":[8],"the":[9,56,65,75],"canonical":[10],"structure":[11],"of":[12,20,33,58,67],"infinite":[13],"Abelian":[14],"groups":[15],"represented":[16],"by":[17,78],"a":[18],"matrix":[19],"size":[21,57,66],"s":[22,54],"is":[23,27,55,64],"presented.":[24],"Also":[25],"given":[26,77],"an":[28],"solving":[31],"systems":[32],"linear":[34],"Diophantine":[35],"equations":[36],"(say,":[37],"$Ax":[38],"=":[39],"b$)":[40],"in":[41,82],"$O(s^{3.376}":[42],"\\log":[43],"sM(s^2":[44],")":[45],"+":[46],"s^2":[47],"M(s^":[48],"*":[49,62],"operations,":[52],"where":[53],"A":[59],"and":[60,80],"$s^":[61],"$":[63],"b.":[68],"The":[69],"upper":[70],"bounds":[71],"mentioned":[72],"above":[73],"improve":[74],"results":[76],"Chou":[79],"Collins":[81],"[SIAM":[83],"J.":[84],"Comput.,":[85],"11":[86],"(1982),":[87],"pp.687\u2013708].":[88]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}