Skip to search formSkip to main contentSkip to account menu

Primality test

Known as: Detecting primes, Compositeness test, Isprime 
A primality test is an algorithm for determining whether an input number is prime. Amongst other fields of mathematics, it is used for cryptography… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
AC0AKS primality testAdleman–Pomerance–Rumely primality testAlgorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2021
2021
AN AMAZING PRIME HEURISTIC
2 dx (log x)2 ∼ 2C2N (log N)2 where C2, called the twin prime constant, is approximately 0.6601618. Using this we can estimate… 
2016
2016
Optimal Customer Targeting for Sustainable Demand Response in Smart Grids
2012
2012
Amplifying circuit lower bounds against polynomial time, with applications
We give a self-reduction for the Circuit Evaluation problem (CircEval) and prove the following consequences. Amplifying size… 
2011
2011
Applications of elliptic curves in public key cryptography
The most popular public key cryptosystems are based on the problem of factorization of large integers and discrete logarithm… 
2010
2010
Scalable video multicast with joint layer resource allocation in broadband wireless networks
Scalable video coding (SVC), together with adaptive modulation and coding (AMC), can improve wireless multicast streaming video… 
2008
2008
Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem
Previously the author has demonstrated that a representative polynomial search partition is required to solve a NP-complete… 
2006
2006
Infix-free Regular Expressions and Languages
We study infix-free regular languages. We observe the structural properties of finite-state automata for infix-free languages and… 
2000
2000
On P Systems with Active Membranes Solving the Integer Factorization Problem in a Polynomial Time
There are presented deterministic P systems with active membranes which are able to solve the Integer Factorization Problem in a… 
1998
1998
Recognizing Circulant Graphs of Prime Order in Polynomial Time
A circulant graph $G$ of order $n$ is a Cayley graph over the cyclic group ${\bf Z}_n.$ Equivalently, $G$ is circulant iff its… 
1984
1984
ARMA model maximum entropy power spectral estimation
In this paper we show that the appropriate selection of constraints in the variational formulation of spectral estimation leads… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)