Parallel Complexity of Matrix Multiplication.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/tjs/Santos03
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/tjs/Santos03
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Eunice_E._Santos
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1023%2FA%3A1023996628662
>
foaf:
homepage
<
https://doi.org/10.1023/A:1023996628662
>
dc:
identifier
DBLP journals/tjs/Santos03
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1023%2FA%3A1023996628662
(xsd:string)
dcterms:
issued
2003
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/tjs
>
rdfs:
label
Parallel Complexity of Matrix Multiplication.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Eunice_E._Santos
>
swrc:
number
2
(xsd:string)
swrc:
pages
155-175
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/tjs/Santos03/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/tjs/Santos03
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/tjs/tjs25.html#Santos03
>
rdfs:
seeAlso
<
https://doi.org/10.1023/A:1023996628662
>
dc:
subject
parallel complexity; matrix multiplication; LogP model; parallel algorithms; lower bounds; optimality; numerical algorithms; linear algebra; parallel models
(xsd:string)
dc:
title
Parallel Complexity of Matrix Multiplication.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
25
(xsd:string)