搜索资源列表
a223
- 此程式可輸入二個整數，並以歐幾里得演算法求其最大公因數(GCD)-this program can import two integers, and Euclid algorithms for its greatest common divisor (GCD)
acscontrol
- 带约束的蚁群算法的程序，用于欧几里德（Euclid）TSP问题，用c语言编写的，供大家借鉴-Constrained Ant Algorithm procedures for Euclidean (Euclid), TSP, c language used, for everybody's reference
euclid
- c语言经典的实现了最大公约数的算法 可以处理int内的任意整数！还有运行图 及运行处理的结果！-c classical language to achieve a common denominator of the algorithm can handle int the arbitrary integer! There diagram and operation of the outcome!
kzojldsf
- 扩展欧几里得算法 和大数模运算算法 自己写的注释，绝对好用。-expansion Euclid algorithm and computation algorithm for Modular himself wrote the notes, definitely handy.
EUCLID
- 本程序完成了欧几里得算法求最大公约数、扩展欧几里得算法求乘法逆元和素性检验判断输入的数是否为素数
euclid
- 欧几里德算法又称辗转相除法，用于计算两个整数a,b的最大公约数。
1
- RS译码的Euclid算法及其FPGA实现
midify_euclid
- 修正的euclid算法matlab程序，验证通过
EUCLID
- 欧几里德算法：非常实用的！经调试通过！源代码不需任何修改！
bch_matrix_v1_0_tar
- The package contains a Reed-Solomon coding and decoding program, derived partly from Phil Karn/Robert Morelos-Zaragoza \"new_rs_erasures.c\". In particular the Berlekamp-Massey algorithm has not been modified. New
RS_Euclid_FPGA
- RS译码的Euclid算法及其FPGA实现，并通过仿真器的出结果，对于设计ＲＳ译码很有帮助
TestRsa
- 个人编的rsa的源代码，算出public—private key；其中有Euclid，Extend Euclid的实现，以及Millar-Rabin test的实现，和加密/解密
qu
- 就是两个多项式的欧几里得算法，即求两个多项式的最大公约数。-two polynomial is the Euclid algorithm, namely polynomial for the two majors.
qu
- 就是两个多项式的欧几里得算法，即求两个多项式的最大公约数。-two polynomial is the Euclid algorithm, namely polynomial for the two majors.
acscontrol
- 带约束的蚁群算法的程序，用于欧几里德（Euclid）TSP问题，用c语言编写的，供大家借鉴-Constrained Ant Algorithm procedures for Euclidean (Euclid), TSP, c language used, for everybody's reference
K-meaneuclideandistance
- 这个是采用欧氏距离下的K-means算法的matlab实现-this is the Euclidean distance between the K-means algorithm to achieve the Matlab
PolyEuclid061207
- 初学密码内容，共享下实现带多项式的欧几里德算法，请多多指教-novice passwords, shared with polynomials under the Euclidean algorithm, exhibitions
The-Elements-of-Euclid
- This edition of the Elements of Euclid, undertaken at the request of the principals of some of the leading Colleges and Schools of Ireland, is intended to supply a want much felt by teachers at the present day—the pr
Countably-Euclid-Lines
- 发表在 The MIT Talbot 2013 Workshop 的论文-The Existence of Countably Euclid Lines. Latest paper by D. Watanabe.
based-on-Euclid
- 自己以前写的基于欧几里得的小程序。 1.判断一个整数是不是素数 2.计算两个整数的最大公约数 3.计算两个整数的最小公倍数 4.将输入的a,b表示成s*a+t*b=gcd(a,b)的形式 5.求输入的a,m中a模m的逆元-A small program based on Euclid . 1. Determine an integer is not a prime numbe