Primality testing in polynomial time : from randomized algorithms to "PRIMES is in P"

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...

詳細記述

保存先:
書誌詳細
第一著者: Dietzfelbinger, Martin
フォーマット: Livre numérique
言語:Anglais
出版事項: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
シリーズ:Lecture notes in computer science 3000
主題:
オンライン・アクセス:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
注記: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Primality testing in polynomial time, from randomized algorithms to "PRIMES is in P", Martin Dietzfelbinger, 2004, Berlin, Springer, 1 vol. (X-147 p.), Lecture notes in computer science, 3-540-40344-2
• Primality Testing in Polynomial Time, Texte imprimé, 9783662174456

類似資料