Some remarks concerning the complexity of computing class groups of quadratic fields
- 7 September 1991
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 7 (3) , 311-315
- https://doi.org/10.1016/0885-064x(91)90039-z
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Explicit bounds for primality testing and related problemsMathematics of Computation, 1990
- On the parallel generation of the residues for the continued fraction factoring algorithmMathematics of Computation, 1987