On the complexity of testing elite primes.
Křížek, Michal; Luca, Florian; Shparlinski, Igor E.; Somer, Lawrence
Journal of Integer Sequences [electronic only] (2011)
- Volume: 14, Issue: 1, page Article 11.1.2, 5 p., electronic only-Article 11.1.2, 5 p., electronic only
- ISSN: 1530-7638
Access Full Article
top
How to cite
topKřížek, Michal, et al. "On the complexity of testing elite primes.." Journal of Integer Sequences [electronic only] 14.1 (2011): Article 11.1.2, 5 p., electronic only-Article 11.1.2, 5 p., electronic only. <http://eudml.org/doc/222584>.
@article{Křížek2011,
author = {Křížek, Michal, Luca, Florian, Shparlinski, Igor E., Somer, Lawrence},
journal = {Journal of Integer Sequences [electronic only]},
keywords = {elite primes},
language = {eng},
number = {1},
pages = {Article 11.1.2, 5 p., electronic only-Article 11.1.2, 5 p., electronic only},
publisher = {School of Computer Science, University of Waterloo, Waterloo},
title = {On the complexity of testing elite primes.},
url = {http://eudml.org/doc/222584},
volume = {14},
year = {2011},
}
TY - JOUR
AU - Křížek, Michal
AU - Luca, Florian
AU - Shparlinski, Igor E.
AU - Somer, Lawrence
TI - On the complexity of testing elite primes.
JO - Journal of Integer Sequences [electronic only]
PY - 2011
PB - School of Computer Science, University of Waterloo, Waterloo
VL - 14
IS - 1
SP - Article 11.1.2, 5 p., electronic only
EP - Article 11.1.2, 5 p., electronic only
LA - eng
KW - elite primes
UR - http://eudml.org/doc/222584
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.