Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR99-010 | 1st April 1999 00:00

A Lower Bound for Primality

RSS-Feed




TR99-010
Authors: Eric Allender, Igor E. Shparlinski, Michael Saks
Publication: 6th April 1999 11:55
Downloads: 1209
Keywords: 


Abstract:

Recent work by Bernasconi, Damm and Shparlinski
proved lower bounds on the circuit complexity of the square-free
numbers, and raised as an open question if similar (or stronger)
lower bounds could be proved for the set of prime numbers. In
this short note, we answer this question affirmatively, by showing
that the set of prime numbers (represented in the usual binary
notation) is not contained in $\acp$ for any prime $p$. Similar
lower bounds are presented for the set of square-free numbers, and
for the problem of computing the greatest common divisor of two numbers.


Comment(s):

Comment #1 to TR99-010 | 21st June 1999 16:41

An Improvement Comment on: TR99-010





Comment #1
Authors: Eric Allender
Accepted on: 21st June 1999 16:41
Downloads: 1751
Keywords: 


Abstract:

In the revised version, we show that MAJORITY is also reducible
to Primes (and to GCD and to Square.Free).




ISSN 1433-8092 | Imprint