Primality certificate

Known as: Pratt certificate, Atkin-Goldwasser-Kilian-Morain certificate, Pratt certificates 
In mathematics and computer science, a primality certificate or primality proof is a succinct, formal proof that a number is prime. Primality… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
In 1975, Pratt introduced a proof system for certifying primes [1]. He showed that a number p is prime iff a primality… (More)
Is this relevant?
2013
2013
Formula simplification is important for the performance of SAT solvers. However, when applied until completion, powerful… (More)
Is this relevant?
2008
2008
In 1876, E. Lucas showed that a quick proof of primality for a prime p could be attained through the prime factorization of p - 1… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Kernel regression is a well-established method for nonlinear regression in which the target value for a test point is estimated… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
This paper is a comprehensive comparison of existing methods for constructing confidence bands for univariate impulse response… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
2005
2005
Tendency of smooth particles of a size to pneumatically fluidizing from plugging metal transfer conduits is overcome by changing… (More)
Is this relevant?
2002
2002
This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences… (More)
  • table 1
  • table 2
Is this relevant?
2001
2001
We describe in this article how we have been able to extend the record for computations of discrete logarithm sin characteristic… (More)
  • figure 1
  • table 1
Is this relevant?
1999
1999
Extending previous searches for prime Fibonacci and Lucas numbers, all probable prime Fibonacci numbers F n have been determined… (More)
  • table 1
  • table 2
Is this relevant?
1998
1998
In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality… (More)
Is this relevant?