| 书目名称 | Primality Testing in Polynomial Time | | 副标题 | From Randomized Algo | | 编辑 | Martin Dietzfelbinger | | 视频video | | | 概述 | Describes the new deterministic polynomial time primality test (Agrawal/Kayal/Saxena) with complete analysis in a consolidated way.Includes supplementary material: | | 丛书名称 | Lecture Notes in Computer Science | | 图书封面 |  | | 描述 | 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 prime numbers and composite numbers of signi?cant size. Readily, algorithms were provided that solved the problem very e?ciently and satisfactorily for all practical purposes, and provably enjoyed a time bound polynomial in the number of digits needed to write down the input number n. The only drawback of these algorithms is that they use “randomization” — that means the computer that carries out the algorithm performs random experiments, and there is a slight chance that the outcome might be wrong, or that the running time might not be polynomi | | 出版日期 | Textbook 2004 | | 关键词 | Number theory; Prime; algorithm; algorithmics; algorithms; computer; computer science; algorithm analysis a | | 版次 | 1 | | doi | https://doi.org/10.1007/b12334 | | isbn_softcover | 978-3-540-40344-9 | | isbn_ebook | 978-3-540-25933-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 | | issn_series | 0302-9743 | | copyright | Springer-Verlag Berlin Heidelberg 2004 |
The information of publication is updating
|
|
发表于 2025-3-21 20:06:33
