【预订】Primality Testing in Polynomial Time 9783540403449 国外库房发货,通常付款后3-5周到货!
Product Details 基本信息 ISBN-13 书号 9783540403449 Author 作者 Dietzfelbinger Format 版本 平装-胶订 Pages Number 页数 150页 Publisher 出版社 Springer Berlin Heidelberg Publication Date 出版日期 2004-06-29 Language 语种 英语 Book Contents 内容简介 On August 6, 2002,a paper with the title “PRIMES is in P”, by M. Agrawal, N. Kayal, and N. Saxena, appeared on the website of the Indian Institute of Technology at Kanpur, India. In this paper it was shown that the “primality problem”hasa“deterministic algorithm” that runs in “polynomial time”. Finding out whether a given number n is a prime or not is a problem that was formulated in ancient times, and has caught the interest of mathema- ciansagainandagainfor centuries. Onlyinthe 20thcentury,with theadvent of cryptographic systems that actually used large prime numbers, did it turn out to be of practical importance to be able to distinguish pri
¥501.00
预订 Primality Testing in Polynomial Time: From Randomized Alg 【全球购】进口原版图书,约5-8周到达国内后发出
¥636.00
海外直订Primality Testing in Polynomial Time: From Randomized Al
¥553.00
Primality Testing in Polynomial Time多项式时间中的初级测试
¥248.10