A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jsc/BirmpilisLS23
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jsc/BirmpilisLS23
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Arne_Storjohann
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/George_Labahn
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Stavros_Birmpilis
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.jsc.2022.09.002
>
foaf:
homepage
<
https://doi.org/10.1016/j.jsc.2022.09.002
>
dc:
identifier
DBLP journals/jsc/BirmpilisLS23
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.jsc.2022.09.002
(xsd:string)
dcterms:
issued
2023
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jsc
>
rdfs:
label
A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Arne_Storjohann
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/George_Labahn
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Stavros_Birmpilis
>
swrc:
pages
146-182
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jsc/BirmpilisLS23/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jsc/BirmpilisLS23
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jsc/jsc116.html#BirmpilisLS23
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.jsc.2022.09.002
>
dc:
title
A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
116
(xsd:string)