• Computer Science
  • Published 1974

Theorems on factoring and primality testing

@inproceedings{Pollard1974TheoremsOF,
  title={Theorems on factoring and primality testing},
  author={John M. Pollard},
  year={1974}
}

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 10 CITATIONS

Can Integer Factorization be in P?

  • Song Y. Yan, Glyn James
  • Computer Science
  • 2006 International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (CIMCA'06)
  • 2006
VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

MULLIN'S SEQUENCE OF PRIMES IS NOT MONOTONIC

VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Factoring: Algorithms, computations, and computers