Randomized algorithms in number theory
- 1 January 1986
- journal article
- research article
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 39 (S1), S239-S256
- https://doi.org/10.1002/cpa.3160390713
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- Note on representing a prime as a sum of two squaresMathematics of Computation, 1972
- Sums of SquaresThe American Mathematical Monthly, 1970
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- Sums of three squaresProceedings of the American Mathematical Society, 1957
- On the Class-Number of the Corpus P (√−k )Proceedings of the London Mathematical Society, 1928
- The Four Square TheoremJournal of the London Mathematical Society, 1927
- Some problems of ‘Partitio numerorum’; III: On the expression of a number as a sum of primesActa Mathematica, 1923