Sciweavers

COCO   1999 Annual IEEE Conference on Computational Complexity
Wall of Fame | Most Viewed COCO-1999 Paper
COCO
1999
Springer
101views Algorithms» more  COCO 1999»
13 years 8 months ago
A Lower Bound for Primality
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
Eric Allender, Michael E. Saks, Igor Shparlinski
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source101
2Download preprint from source94
3Download preprint from source79
4Download preprint from source76