Abstract
For a prime , let be the discriminant of an imaginary quadratic order with . We research the solutions of the class polynomial mod in if is not a quadratic residue in . We also discuss the common roots of different class polynomials in . As a result, we get a deterministic algorithm (Algorithm 3) for computing the class number of . The time complexity of Algorithm 3 is .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.