{"id":"https://openalex.org/W2015161630","doi":"https://doi.org/10.1137/0218045","title":"Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix","display_name":"Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix","publication_year":1989,"publication_date":"1989-08-01","ids":{"openalex":"https://openalex.org/W2015161630","doi":"https://doi.org/10.1137/0218045","mag":"2015161630"},"language":"en","primary_location":{"id":"doi:10.1137/0218045","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218045","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":3.5531,"has_fulltext":false,"cited_by_count":127,"citation_normalized_percentile":{"value":0.92963396,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"18","issue":"4","first_page":"658","last_page":"669"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11130","display_name":"Coding theory and cryptography","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10849","display_name":"Finite Group Theory Research","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7485596537590027},{"id":"https://openalex.org/keywords/abelian-group","display_name":"Abelian group","score":0.6622134447097778},{"id":"https://openalex.org/keywords/integer-matrix","display_name":"Integer matrix","score":0.6535146236419678},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6157049536705017},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5869857668876648},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5480164289474487},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4383693337440491},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4383094608783722},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4380091726779938},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3947335481643677},{"id":"https://openalex.org/keywords/symmetric-matrix","display_name":"Symmetric matrix","score":0.248632550239563},{"id":"https://openalex.org/keywords/nonnegative-matrix","display_name":"Nonnegative matrix","score":0.13251149654388428},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11758595705032349}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7485596537590027},{"id":"https://openalex.org/C136170076","wikidata":"https://www.wikidata.org/wiki/Q181296","display_name":"Abelian group","level":2,"score":0.6622134447097778},{"id":"https://openalex.org/C62555958","wikidata":"https://www.wikidata.org/wiki/Q6042601","display_name":"Integer matrix","level":5,"score":0.6535146236419678},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6157049536705017},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5869857668876648},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5480164289474487},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4383693337440491},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4383094608783722},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4380091726779938},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3947335481643677},{"id":"https://openalex.org/C54848796","wikidata":"https://www.wikidata.org/wiki/Q339011","display_name":"Symmetric matrix","level":3,"score":0.248632550239563},{"id":"https://openalex.org/C139018669","wikidata":"https://www.wikidata.org/wiki/Q6961560","display_name":"Nonnegative matrix","level":4,"score":0.13251149654388428},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11758595705032349},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0218045","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218045","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:CiteSeerX.psu:10.1.1.531.9309","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.531.9309","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sage.math.washington.edu/home/pernet/Papers/Hermite/Iliopoulos88.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W64896740","https://openalex.org/W1583935850","https://openalex.org/W1655990431","https://openalex.org/W1979740015","https://openalex.org/W2032980094","https://openalex.org/W2035476608","https://openalex.org/W2110221038","https://openalex.org/W2250444211","https://openalex.org/W4238521487"],"related_works":["https://openalex.org/W2958975737","https://openalex.org/W2625223621","https://openalex.org/W2963754092","https://openalex.org/W2393028428","https://openalex.org/W2366105249","https://openalex.org/W2973235923","https://openalex.org/W4385335055","https://openalex.org/W1944957487","https://openalex.org/W2865773129","https://openalex.org/W2088158318"],"abstract_inverted_index":{"An":[0],"$O(s^5":[1],"M(s^2":[2,37],"))$":[3,38],"algorithm":[4,39],"for":[5,40],"computing":[6,41],"the":[7,25,30,42,60,64,68],"canonical":[8],"structure":[9],"of":[10,20,29,46,50,63],"a":[11],"finite":[12],"Abelian":[13],"group":[14],"represented":[15],"by":[16,72],"an":[17,35,47],"integer":[18,48],"matrix":[19,49],"size":[21,51],"s":[22,52],"(this":[23],"is":[24,32,53],"Smith":[26],"normal":[27,44],"form":[28,45],"matrix)":[31],"presented.":[33],"Moreover,":[34],"$O(s^3":[36],"Hermite":[43],"given.":[54],"The":[55],"upper":[56,69],"bounds":[57,70],"derived":[58],"on":[59],"computational":[61],"complexity":[62],"algorithms":[65],"above":[66],"improve":[67],"given":[71],"Kannan":[73],"and":[74,84,86],"Bachem":[75],"in":[76,88],"[SIAM":[77,89],"J.":[78,90],"Comput.,":[79,91],"8":[80],"(1979),":[81],"pp.":[82,94],"499\u2013507]":[83],"Chou":[85],"Collins":[87],"11":[92],"(1982),":[93],"687\u2013708].":[95]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
