搜索资源列表
rk_str
- RK算法：Rabin Karp string search algorithm,一种高效的字符串搜索算法-RK algorithm : Rabin Karp string search algorithm, An Efficient Algorithm String Search
数论
- 64位以内Rabin-Miller 强伪素数测试和Pollard rho 因数分解算法的实现-64 within Rabin-Miller-puppet prime testing and Pollard rho factorization algorithm implementation
Rabin-Karp
- 字符串模式匹配的RK算法，其中的滚动哈希很有价值-RK string pattern matching algorithm, in which the rolling hash valuable
Rabin-Kharp
- huffman coding which will make u encoding
Miller-Rabin-c
- 求质数的算法之Miller-Rabin费马小定理-Prime number for the Miller-Rabin algorithm of Fermat' s Little Theorem
MillerR
- Miller-Rabin test for simple numbers.
rk
- Rabin-Karp algorithm
MillerRabin
- Miller Rabin素数测试，可以在O（1）时间复杂度内测试大素数，使用随机化思想-Miller Rabin prime test
AlgoritmRabina_Karpa
- The Rabin–Karp algorithm is a string searching algorithm created by Michael O. Rabin and Richard M. Karp in 1987 that uses hashing to find any one of a set of pattern strings in a text. For text of length n and p patterns of combined length m, its av
RABIN-KARP
- Faster string matching using Rabin-Karp algorithm
MillerRabin()
- 素性检测的miller-rabin算法-Primality testing
pollard-rho__miller-rabin
- pollard_rho 产生某数的随机因子 && miller_rabin 素数测试 acm数论算法 poj1811 ac代码-pollard_rho & miller_rabin the num_theory algorithm of ACM the accept source code of poj1811
miller-rabin
- this miller rabin source code-this is miller rabin source code
miller
- 64位以内Rabin-Miller 强伪素数测试和Pollard rho 因数分解 -64 within the Rabin-Miller strong pseudo-primes test and Pollard rho factorization
rabin_karp
- An implementation of the Rabin Karp Algorithm to find the longest common sub-sequence between to strings in C.
algorithms-master
- 1. 经典的算法实现 2. 服务器端 3. 正确，易于使用和改造, 一个头文件一个算法，并附带一个demo. 1. 一个算法用一个.h文件表示放到include下.2. 算法演示的demo程序放到src下.3. 程序正确通过后，请发起Pull Requests，代码被验证后入库，并在README中发布新算法实现。 已实现 ( Implemented ): Array shuffle Prime test(trial division) Prime test(Mi
rabin-karp
- fingerprints rabin karp algorithm
miller_rabin
- Miller-Rabin质数测试 输入 第1行：1个正整数t，表示数字的个数，10≤t≤50 第2..t+1行：每行1个正整数，第i+1行表示正整数a[i]，2≤a[i]≤10^18 输出 第1..t行：每行1个字符串，若a[i]为质数，第i行输出 Yes ，否则输出 No -Miller-Rabin primality test input The first line: 1 positive integer T, said a number
Miller_Prime
- Miller-Rabin 素性检测 能够快速地对一个整数进行素性检测-Miller-Rabin primality testing can be carried out quickly to an integer primality testing
gemhyr
- 这是个很容易且广泛使用的简单算法,它基于Gary Miller的部分象法,有Michael Rabin发展,事实上,这是在()