Deterministic and Las Vegas primality testing algorithms

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 12th Colloquium
EditorsWilfried Brauer
PublisherSpringer Verlag
Pages199-209
Number of pages11
ISBN (Print)9783540156505
DOIs
StatePublished - Jan 1 1985
Event12th International Colloquium on Automata, Languages and Programming, ALP 1985 - Nafplion, Greece
Duration: Jul 15 1985Jul 19 1985

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume194 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Colloquium on Automata, Languages and Programming, ALP 1985
CountryGreece
CityNafplion
Period7/15/857/19/85

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Deterministic and Las Vegas primality testing algorithms'. Together they form a unique fingerprint.

  • Cite this

    Furer, M. (1985). Deterministic and Las Vegas primality testing algorithms. In W. Brauer (Ed.), Automata, Languages and Programming - 12th Colloquium (pp. 199-209). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 194 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0015745