Resultado da Busca
Volker Strassen (born April 29, 1936) is a German mathematician, a professor emeritus in the department of mathematics and statistics at the University of Konstanz. Read more on Wikipedia Since 2007, the English Wikipedia page of Volker Strassen has received more than 94,716 page views.
Algoritmo de Strassen. En la disciplina matemática del álgebra lineal, el algoritmo de Strassen, llamado así por Volker Strassen, es un algoritmo usado para la multiplicación de matrices. Es asintóticamente más rápido que el algoritmo de multiplicación de matrices estándar, pero más lento que el algoritmo más rápido conocido, y es ...
1 de abr. de 2024 · 沃尔克·施特拉森（德语： Volker Strassen ，1936年4月29日 — ）是一名德国 数学家，康斯坦茨大学数学和统计系的名誉教授 。. 施特拉森因对算法分析的重要贡献而获得许多奖项，包括康托尔奖章 、 康拉德·楚泽奖章 （ 英语 ： Konrad Zuse Medal ） 、因 随机质数测试 （ 英语 ： Solovay–Strassen primality test ...
Volker Strassen first published his algorithm in 1969. It was the first algorithm to prove that the basic O(n^3) runtime was not optiomal. The basic idea behind Strassen's algorithm is to split A & B into 8 submatricies and then recursively compute the submatricies of C .
Volker Strassen, född 29 april 1936, är en tysk matematiker, professor emeritus vid institutionen för matematik och statistik vid Universitetet i Konstanz. För hans viktiga bidrag till analysen av algoritmer, har han fått många utmärkelser, inklusive Kantormedaljen, Konrad Zuse-medaljen, Paris Kanellakis-utmärkelsen för arbete med ...
In 1969 Volker Strassen, a German mathematician, smashed the O(n³) barrier, reducing the matrix multiplication to 7 multiplications and 18 additions, getting to a complexity of O(n²·⁸⁰⁸)[8]. If we consider a set of matrices A, B and C, as in fig.3, Strassen derived the following algorithm:
