搜索资源列表
-
0下载：
Erasure correction achieved by two errors-only decoding passes using the Euclidean algorithm. Any (valid) code length can be input.
-Erasure correction achieved by two errors - only decoding passes using the Euclidean algo rithm. Any (valid) code
-
-
0下载：
扩展欧几里德算法不但能计算(a,b)的最大公约数，而且能计算a模b及b模a的乘法逆元。平方和乘算法的复杂度：执行次数至少要k次模乘，最多需要２ｋ次模乘。-Extended Euclidean algorithm for computing not only (a, b) the common denominator, and to calculate a modulus b and b modulus a multiplicative inverse of. Square and by the
-
-
0下载：
扩展欧几里德定理和中国剩余定理，ACM算法课件，比较简洁-Extended Euclidean theorems and Chinese Remainder Theorem, ACM algorithm courseware, simple comparison
-
-
0下载：
extended euclidean algorithm for polynomials with maple
-
-
0下载：
用蛮力法，分解质因数法，欧几里得算法分别求解最大公约数问题-With the brute force method, the quality factor decomposition method, the Euclidean algorithm for greatest common divisor problem solving, respectively
-
-
0下载：
( Rightmost Digit )代码：数论模幂算法（从左向右）0ms
最小公倍数-辗转相除法
Prim最小生成树-Rightmost Digit, modular exponentiation algorithm (from left to right) 0ms
Least common multiple- Euclidean algorithm
Prim minimum spanning tree
-
-
0下载：
欧几里德最大公因子算法
欧几里德最大公因子算法-Euclidean algorithm Euclidean greatest common factor greatest common factor algorithm
-
-
0下载：
运用欧几里得算法求解最大公约数，并对算法的时间性能进行分析
-Greatest common divisor using the Euclidean algorithm, and analyze the performance of the algorithm time
-
-
0下载：
java实现多项式加法，乘法，除法，利用辗转相除法求两个多项式的最大公因子-java achieve polynomial addition, multiplication, division, using Euclidean algorithm for greatest common divisor of two polynomials
-
-
0下载：
拓展欧几里德算法，控制台程序，求解sa+tb=1中的s,t-Expansion of the Euclidean algorithm, console program, solving sa+ tb = 1 s, t
-
-
0下载：
欧几里得算法
Euclidean algorithm
希望帮到大家-Euclidean algorithm
-
-
0下载：
欧几里得算法,用来计算两个数的最大公约数。此算法，基于数论的偶记离得算法-Euclidean algorithm, used to calculate the greatest common divisor of two numbers. This algorithm, based on number theory even remember from the algorithm
-
-
0下载：
大数的除法，将大数以数组的形式输入进去并且输出所得的商，可以用于欧几里德扩展算法-Division of large numbers will be entered as an array of large numbers into and outputs the quotient can be used for extended Euclidean algorithm
-
-
0下载：
欧几里得算法，很详尽的解释说明，扩展欧几里得算法，求最大公约数-Euclidean algorithm, a very detailed explanation, extended Euclidean algorithm, find the greatest common divisor
-
-
0下载：
欧几里得算法 非常给力 值得参考 招来不易啊-Euclid' s algorithm is very difficult to force ah worth considering provoke
-
-
0下载：
实验项目- 计算最大公因子
用辗转相除法求210与715的最大公因数。-Experimental project- calculate the greatest common factor with the Euclidean algorithm 210 and 715 of the greatest common divisor.
-
-
0下载：
1、用辗转相除法计算任意两个整数a、b的最大公因子。进一步求出整数s、t，使得sa+tb=(a,b)。特别地，当a=3378,b=231时，求出相应的s,t以及a与b的最大公因子(a,b)。将结果写入a.txt中。
2、用辗转相除法计算任意两个整数a、b的最小公倍数。特别地，当a=12345,b=54321时，计算其最小公倍数。将结果写入b.txt中。
3、对e=6597，用辗转相除法求出d，使得ed=1 mod 11200。将结果写入c.txt中。
-1, with the Euc
-
-
0下载：
辗转相除法 模重复平方；模P平方根；三个算法的C++实现-Euclidean algorithm mold repeat square mold P Square Root
-
-
0下载：
该VC程序中，包含了求最大公约数的三种方法：1、欧几里得算法；2、求全部质因数方法；3、连续整数检测方法-The VC program, including the common denominator of the three methods: 1, Euclidean algorithm 2, find all the prime factor method 3 consecutive integers detection method
-
-
0下载：
实现欧几里算法和扩展欧几里算法，通过读取CPU的定时器，比较算法效率-Achieve Euclidean algorithm and extended Euclidean algorithm, by reading the CPU timers, comparison algorithm efficiency
-
