53 citations · 136 across the 14 of their papers we have counts for
1 paper · 1 filter
Marco Streng
We bound the running time of an algorithm that computes the genus-two class polynomials of a primitive quartic CM-field K. This is in fact the first running time bound and even the…