On Primes Recognizable in Deterministic Polynomial Time

Sergei Konyagin () and Carl Pomerance ()
Additional contact information
Sergei Konyagin: Steklov Institute of Mathematics
Carl Pomerance: Dartmouth College, Department of Mathematics

A chapter in The Mathematics of Paul Erdős I, 2013, pp 159-186 from Springer

Abstract: Summary We discuss some simple deterministic algorithms that establish primality for a robust set of primes in polynomial time. The first 6 sections comprise the intact original article published in the first edition of this volume in 1997. The last 2 sections discuss developments in this fast-moving field to early 2013, and refer to the prior sections in the past tense. The bibliography for the original article and the new update have been combined.

Keywords: Polynomial Time; Prime Factor; Arithmetic Operation; Binary Search; Deterministic Algorithm (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-7258-2_12

Ordering information: This item can be ordered from
http://www.springer.com/9781461472582

DOI: 10.1007/978-1-4614-7258-2_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().