登录
首页 » Visual C++ » Strassen-code

Strassen-code

于 2014-11-28 发布 文件大小:4660KB
0 217
下载积分: 1 下载次数: 3

代码说明:

  思塞恩算法 常用算法之一 算法导论提及(strassen algorithm which can run correctly)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • hellow4
    序列二次规划算法,能求解包含约束和无约束的问题,非常方便。(Sequential quadratic programming algorithm to solve constrained and unconstrained contain the problem, very convenient.)
    2021-01-08 18:18:51下载
    积分:1
  • 3_abstract_data_struct
    数据结构:抽象数据类型的介绍;讲述如何构造函数和如何实现;(Data structure: the introduction of abstract data types on how to structure function and how to achieve )
    2008-04-14 22:56:33下载
    积分:1
  • jgctgu
    流水线车间的零件加工排序问题,以达到最优的加工顺序,使加工时间最短或零件后期维护费用最少(Plant parts processing pipeline scheduling problem, in order to achieve optimal machining sequence, so that the processing time of the shortest or least parts later maintenance costs)
    2014-05-08 01:12:54下载
    积分:1
  • jose
    约瑟夫环(约瑟夫问题)是一个数学的应用问题:已知n个人(以编号1,2,3...n分别表示)围坐在一张圆桌周围。从编号为k的人开始报数,数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规律重复下去,直到圆桌周围的人全部出列。通常解决这类问题时我们把编号从0~n-1,最后结果+1即为原问题的解。 (Josephus (Josephus problem) is the application of a mathematical problem: Given n individuals (with numbers 1,2,3 ... n respectively) sitting around a round table. From the number of people gettin k, number of the m man out of the line he s the next person and a number of gettin number to m the man was out of the line and so the law is repeated until the round table were all out of the column. We numbered 0 ~ n-1, the final result is the original problem solution+1 usually solve these problems.)
    2015-01-09 17:28:41下载
    积分:1
  • abc
    数据结构的稀疏矩阵的几部分操作,广工的课程设计(Sparse matrix operations)
    2013-12-03 15:57:53下载
    积分:1
  • Dijlstra
    Dijlstra算法 对任意图,选择合适的数据结构表示图,在此基础上实现求解最短路径的Dijkstra算法(Dijlstra algorithm to arbitrary map, select the appropriate data structures that map, on this basis to achieve solution of the Dijkstra shortest path algorithm)
    2009-01-11 19:03:11下载
    积分:1
  • 太阳能电池参计算器 升级版
    太阳能电池参数计算,可以快速方便计算电流,电压,填充因子等参数(Solar cell parameter calculation)
    2017-11-23 21:30:46下载
    积分:1
  • Huffman-Tree
    使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率,并据此构造Huffman树,编制Huffman 码;根据已经得到的编码,对01形式的编码段进行译码。 具体的要求: 1.将给定字符文件编码,生成编码,输出每个字符出现的次数和编码; 2.将给定编码文件译码,生成字符,输出编码及其对应字符。 (Emergence of the frequency of each character in the trigeminal lists using the Huffman tree, statistics inputfile1.txt, and accordingly the Huffman tree structure, preparation of Huffman code according to the coding has been. 01 to form the code segment for decoding. Specific requirements: 1 coding the given character file, generating the encoding, and outputting the number and encoding of each character 2 will be given the encoding file decoding, generating the character, the output code and its corresponding character.)
    2015-05-22 15:37:03下载
    积分:1
  • template
    说明:  ACM及各类基本算法模板,包括数据结构,计算几何,字符串,图论,数学,高精度等许多常用模板(ACM basic algorithm and various templates, including data structures, computational geometry, string, graph theory, mathematics, high-precision, and many other commonly used templates)
    2009-08-20 22:37:29下载
    积分:1
  • chessboard-distance
    一道poj上的问题的解答,棋盘上的距离问题。即实现棋盘上从一个点移动到王,后,兵之间最短步数的解答。(A poj answers to your questions on the chessboard distance problem. That is, move from one point to the king on the board, after the shortest number of steps between the soldiers answer.)
    2012-06-20 10:10:45下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载