2004International Journal of Quantum InformationRequires access

TESTING PRIMALITY DETERMINISTICALLY

Carlo Toffalori

Open publisher page 0 citations

Abstract

We introduce and discuss the recent Agrawal–Kayal–Saxena deterministic algorithm solving primality in polynomial time.

About this research paper

What this paper is about

We introduce and discuss the recent Agrawal–Kayal–Saxena deterministic algorithm solving primality in polynomial time.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We introduce and discuss the recent Agrawal–Kayal–Saxena deterministic algorithm solving primality in polynomial time.

Key concepts: Primality test, Computer science, Algorithm, Mathematics, Discrete mathematics, Theoretical computer science, Combinatorics, Prime (order theory)

Related papers

Back to paper searchBrowse research topicsOriginal source
TESTING PRIMALITY DETERMINISTICALLY — Research Paper | ScholarLens