搜索资源列表
Strassen
- sterasen mul in assembeli code more dan 700line
mat
- Java matrix strassen
STRASSEN
- 矩阵乘法是线性代数中最常见的运算之一，它在数值计算中有广泛的应用。若A和B是2个n×n的矩阵，则它们的乘积C=AB同样是一个n×n的矩阵-Matrix multiplication is linear algebra is the most common operation, it is one of the numerical calculation is widely used. If A and B is 2 n* n matrix, then their product C = AB i
straseen-2
- 使用c++实现了strassen算法，既8阶矩阵乘法。-Use c++ implementation of strassen algorithm, both 8-order matrix multiplication.
Strass
- Strassen矩阵乘法 分治法 矩阵乘法 时间复杂度O(n^2.81)-Strassen matrix multiplication, divide and conquer matrix multiplication time complexity O (n ^ 2.81)
MatrixMultiply
- 自动构建随机矩阵进行普通矩阵乘法和Strassen矩阵乘法.运算完成后会将两种算法的结果进行比较,并且会输出两种算法各自花费的时间.-Automatically build a random matrix ordinary matrix multiplication and Strassen matrix multiplication. Operation is completed the results will compare the two algorithms, and outputs
new2
- Implemnting strassen multiplication in c-Implemnting strassen multiplication in c++
FLOYD-Algorithm-By-Abdelbaset-Alzeen
- standard and strassen alogrithm by c-standard and strassen alogrithm by c++
TarsusPmultiplication
- 分治法大整数乘法课件 概述：算法概要、算法效率 合并排序 快速排序 折半查找 大整数乘法 Strassen 矩阵乘法 分治法解凸包 -Divide and conquer integer multiplication courseware about the function and some problems very effective way to solve the that serious .I think it will be ok!
yuwen1
- 实验题目 分治算法的应用 实验内容 1、 二分搜索算法实现； 2、 大整数乘法或Strassen矩阵乘法的实现。 -Experimental subject partition use of the algorithm The experiment content 1, search algorithm dichotomy 2, big integer Strassen multiplication or the realization of the matrix
Strassn
- 使用c++实现了strassen算法，非运行程序-Achieve strassen algorithm
MatrixMultiply
- 用分治法和Strassen方法，并进行效率的比较，有图形界面，输出结果用log4j输出到文件中。-With partition and Strassen method, and comparison of the efficiency, has a graphical interface, using log4j output the results output to a file
StraMatMulti
- 用c语言写的strassen矩阵算法，支持非方阵用0填充为方阵的算法，编译通过，0错误哦-compiled success，edit in c
Miller-Rabin_primality_test_(Java)
- Miller Rabin:Just like the Fermat and Solovay–Strassen tests, the Miller–Rabin test relies on an equality or set of equalities that hold true for prime values, then checks whether or not they hold for a number that we want to test for primality.
juzhen
- 矩阵Strassen算法，调试成功，和普通矩阵乘法的比较。-Strassen matrix algorithms, debugging success, and the general comparison matrix multiplication.
Matrix
- Matrix multiplication using Strassen.
j_strassen_2
- it is strassen algorithm. using java source.
strassen_mmse4x4
- strassen algorithm for inversion 4x4 matrix
strassen_mmse4x4_ver2
- strassen algorithm for inversion matrix 4x4-strassen algorithm for inversion matrix 4x4
CPPStrassen_-matrix
- implementation of strassen matrix in C++. strassen algorithm is faster than standard matrix multiplication algorithm