Matches in DBpedia 2016-04 for { <http://doi.org/10.1137/0218045> ?p ?o }
Showing triples 1 to 14 of
14
with 100 triples per page.
- 0218045 doi "10.1137/0218045".
- 0218045 first "Costas S.".
- 0218045 isCitedBy Matrix_multiplication.
- 0218045 isCitedBy Matrix_multiplication_algorithm.
- 0218045 issue "4".
- 0218045 journal "SIAM Journal on Computing".
- 0218045 last "Iliopoulos".
- 0218045 mr "1004789".
- 0218045 pages "658–669".
- 0218045 quote "The Coppersmith–Winograd algorithm is not practical, due to the very large hidden constant in the upper bound on the number of multiplications required.".
- 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".
- 0218045 url Iliopoulos88.pdf.
- 0218045 volume "18".
- 0218045 year "1989".