Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Let C(−d) denote the Gauss Class Group of quadratic forms of a negative discriminant −d (or equivalently, the class group of the imaginary quadratic field Q(Equation presented)). We give a rigorous proof that there exists a Las Vegas algorithm that will compute the structure of C(−d) with an expected running time of (Equation presented) bit operations, where (Equation presented). Thus, of course, also includes the computation of the class number h(−d), the cardinality of C(−d). © 1989 American Mathematical Society.
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007