Some remarks concerning the complexity of computing class groups of quadratic fields

DOI10.1016/0885-064X(91)90039-ZzbMath0744.11067MaRDI QIDQ1179460

Johannes A. Buchmann, Hugh C. Williams

Publication date: 26 June 1992

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

complexityquadratic number fieldsclass group computations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quadratic extensions (11R11) Number-theoretic algorithms; complexity (11Y16) Class numbers, class groups, discriminants (11R29)

Related Items (1)

Decision problems in quadratic function fields of high genus

Cites Work

• Explicit Bounds for Primality Testing and Related Problems
• On the Parallel Generation of the Residues for the Continued Fraction Factoring Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some remarks concerning the complexity of computing class groups of quadratic fields