@inproceedings{dad3f85bfa9349a8a020002f660d6d26,
title = "Deterministic and Las Vegas primality testing algorithms",
abstract = "Some deterministic and Las Vegas primality tests are presented. Under certain conditions, they run in polynomial time. In particular, there is a polynomial time Las Vegas algorithm deciding primality of n, when n hat at most 2 prime factors and n ≢ 1 mod 24.",
author = "Martin F{\"u}rer",
note = "Publisher Copyright: {\textcopyright} 1985, Springer-Verlag.; 12th International Colloquium on Automata, Languages and Programming, ALP 1985 ; Conference date: 15-07-1985 Through 19-07-1985",
year = "1985",
doi = "10.1007/BFb0015745",
language = "English (US)",
isbn = "9783540156505",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "199--209",
editor = "Wilfried Brauer",
booktitle = "Automata, Languages and Programming - 12th Colloquium",
address = "Germany",
}