Now the standard algorithm used in
所在版块:社会百科 发贴时间:2003-04-26 07:18  评分:

用户信息
复制本帖HTML代码
高亮: 今天贴 X 昨天贴 X 前天贴 X 
industry is the randomized algorithm for prime

http://webster.cs.uga.edu/~boanerg/fall2001/csci6610/Randomized_Algorithms.doc

however, recently, a new algorithm proposed by an Indian professor which is a determinstic

http://www.cse.iitk.ac.in/news/primality.html


However, that new algorithm has great significance in theory, but it won't be adopted by the industry since the randomized algorithm is easier to implement and yields accpetable results nearly all the time.

You know industry differs a little bit from theory, in a sense that theory always requires preciseness while a good approximation with high efficiency is more valuable.
.
欢迎来到华新中文网,踊跃发帖是支持我们的最好方法!

Put your OWN COOL signature here!
 相关帖子 我要回复↙ ↗回到正文
质数算法 很硬   (225 bytes , 795reads )
不知道这个方法对不对。。。 nomore   (283 bytes , 474reads )
关于验证质数 PvsNP   (790 bytes , 589reads )
上次有一个印度学者来NUS讲学,说判断质数是P的算法 吴永铮   (135 bytes , 578reads )
在一篇文章里看到的 PvsNP   (374 bytes , 229reads )
呵呵,你理解错了 吴永铮   (173 bytes , 251reads )
我有点明白了 PvsNP   (310 bytes , 246reads )
我有点明白了 PvsNP   (310 bytes , 221reads )
几年前复旦一个教授(不是计算机系的)声称解决了 请走人行道   (78 bytes , 211reads )
说说我地 很硬   (85 bytes , 249reads )
我是想照这样算下去很有可能找到一个很大的质数 很硬   (100 bytes , 219reads )
我们cryptography里讲到的primality test 请走人行道   (128 bytes , 257reads )
好像不对吧。。。。。。 nomore   (121 bytes , 251reads )
只好用数论证明啦 :P 有话想说   (36 bytes , 232reads )
算了几个大数, 出现了一个不是质数 很硬   (31 bytes , 282reads )
Now the standard algorithm used in 大一的人   (645 bytes , 378reads )
to the industry 大一的人   (0 bytes , 235reads )