Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q17082383> ?p ?o }
Showing triples 1 to 52 of
52
with 100 triples per page.
- Q17082383 subject Q21293176.
- Q17082383 abstract "Because matrix multiplication is such a central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms efficient. Applications of matrix multiplication in computational problems are found in many fields including scientific computing and pattern recognition and in seemingly unrelated problems such counting the paths through a graph. Many different algorithms have been designed for multiplying matrices on different types of hardware, including parallel and distributed systems, where the computational work is spread over multiple processors (perhaps over a network).Directly applying the mathematical definition of matrix multiplication gives an algorithm that takes time on the order of n3 to multiply two n × n matrices (Θ(n3) in big O notation). Better asymptotic bounds on the time required to multiply matrices have been known since the work of Strassen in the 1960s, but it is still unknown what the optimal time is (i.e., what the complexity of the problem is).".
- Q17082383 wikiPageWikiLink Q1049914.
- Q17082383 wikiPageWikiLink Q1087987.
- Q17082383 wikiPageWikiLink Q11216.
- Q17082383 wikiPageWikiLink Q117801.
- Q17082383 wikiPageWikiLink Q126736.
- Q17082383 wikiPageWikiLink Q141488.
- Q17082383 wikiPageWikiLink Q1430640.
- Q17082383 wikiPageWikiLink Q1549489.
- Q17082383 wikiPageWikiLink Q16935558.
- Q17082383 wikiPageWikiLink Q17082383.
- Q17082383 wikiPageWikiLink Q17090179.
- Q17082383 wikiPageWikiLink Q1786640.
- Q17082383 wikiPageWikiLink Q179976.
- Q17082383 wikiPageWikiLink Q180634.
- Q17082383 wikiPageWikiLink Q181296.
- Q17082383 wikiPageWikiLink Q18156763.
- Q17082383 wikiPageWikiLink Q1868547.
- Q17082383 wikiPageWikiLink Q1869750.
- Q17082383 wikiPageWikiLink Q189224.
- Q17082383 wikiPageWikiLink Q192969.
- Q17082383 wikiPageWikiLink Q205084.
- Q17082383 wikiPageWikiLink Q21293176.
- Q17082383 wikiPageWikiLink Q232661.
- Q17082383 wikiPageWikiLink Q2393193.
- Q17082383 wikiPageWikiLink Q269878.
- Q17082383 wikiPageWikiLink Q2835781.
- Q17082383 wikiPageWikiLink Q2835794.
- Q17082383 wikiPageWikiLink Q333464.
- Q17082383 wikiPageWikiLink Q352090.
- Q17082383 wikiPageWikiLink Q378859.
- Q17082383 wikiPageWikiLink Q4043169.
- Q17082383 wikiPageWikiLink Q423986.
- Q17082383 wikiPageWikiLink Q5157305.
- Q17082383 wikiPageWikiLink Q567759.
- Q17082383 wikiPageWikiLink Q628338.
- Q17082383 wikiPageWikiLink Q65212.
- Q17082383 wikiPageWikiLink Q6522941.
- Q17082383 wikiPageWikiLink Q671298.
- Q17082383 wikiPageWikiLink Q728507.
- Q17082383 wikiPageWikiLink Q7371746.
- Q17082383 wikiPageWikiLink Q764810.
- Q17082383 wikiPageWikiLink Q7843528.
- Q17082383 wikiPageWikiLink Q810007.
- Q17082383 wikiPageWikiLink Q874429.
- Q17082383 wikiPageWikiLink Q884772.
- Q17082383 wikiPageWikiLink Q917612.
- Q17082383 wikiPageWikiLink Q922367.
- Q17082383 wikiPageWikiLink Q954821.
- Q17082383 comment "Because matrix multiplication is such a central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms efficient. Applications of matrix multiplication in computational problems are found in many fields including scientific computing and pattern recognition and in seemingly unrelated problems such counting the paths through a graph.".
- Q17082383 label "Matrix multiplication algorithm".