Welcome![Sign In][Sign Up]
Location:
Search - Miller_Rabin

Search list

[MultiLanguagemiller_rabin

Description: Miller-Rabin算法判断伪素性-Miller - Rabin Prime algorithm judgment pseudo
Platform: | Size: 1468 | Author: 胡昊 | Hits:

[MultiLanguagemiller_rabin

Description: Miller-Rabin算法判断伪素性-Miller- Rabin Prime algorithm judgment pseudo
Platform: | Size: 1024 | Author: 胡昊 | Hits:

[Linux-UnixMiller_Rabin.cpp

Description: 米勒瑞宾素数测试 大素数测试高效算法 测试一个数是否为素数-Miller Rabin test test whethere it is a prime number
Platform: | Size: 2048 | Author: Alex | Hits:

[Mathimatics-Numerical algorithmspollard-rho__miller-rabin

Description: pollard_rho 产生某数的随机因子 && miller_rabin 素数测试 acm数论算法 poj1811 ac代码-pollard_rho & miller_rabin the num_theory algorithm of ACM the accept source code of poj1811
Platform: | Size: 1024 | Author: gouxudong | Hits:

[Data structsMILLER_RABIN

Description: MILLER_RABIN随机算法,计算100000之200000之内的素数,测试生成个数和具体数。-MILLER_RABIN,probobility algorithm,used to test the sushu in 100000 to 200000
Platform: | Size: 881664 | Author: monica | Hits:

[Data structsmain

Description: miller_rabin素数生成算法,KMP,Monte Carlo 和Las Vegas字符串匹配算法-00 00 00
Platform: | Size: 2048 | Author: liufan | Hits:

[Button controlmiller

Description: 通过汇编,用MIller_Rabin素判定法则,进行素数判定-By assembling MIller_Rabin factors determine the rule primes decision
Platform: | Size: 6144 | Author: live | Hits:

[AlgorithmPrimeTest2

Description: 用于素数测试的一个程序,可用朴素方法和Miller_Rabin算法进行测试,效率较高。-A program that can be used simple method and Miller_Rabin algorithms for prime testing test higher efficiency.
Platform: | Size: 1024 | Author: james | Hits:

[Linux drivermain.cpp

Description: 素数测试 miller rabin 提高算法 随机版 算法导论Introduction of Algorithms-Primes test of Miller_Rabin Algorithm Introduction of Algorithms
Platform: | Size: 1024 | Author: cyztuo | Hits:

[Algorithmmiller_rabin

Description: 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 of figures, 10 t 50 Line 2..T+1: each line of 1 positive integers, i+1 expressed a positive integer a[i], 2 a[i] 10^18 output Line 1..T: 1 string per line, if a[i] is a prime number, the I output Yes , otherwise output No
Platform: | Size: 1792000 | Author: 李慧林 | Hits:

[Internet-Network素数判断

Description: 生成大素数,利用了时间随机种子。并且用Miller_Rabin测试法,判定素数(Generating large prime numbers takes advantage of temporal random seeds. And the Miller_Rabin test is used to determine the prime number)
Platform: | Size: 2338816 | Author: hehexjq | Hits:

CodeBus www.codebus.net