Given a non-empty genus in n dimensions with determinant d, we give a
randomized algorithm that outputs a quadratic form from this genus. The time
complexity of the algorithm is poly(n,logd); assuming Generalized Riemann
Hypothesis (GRH).Comment: arXiv admin note: text overlap with arXiv:1409.619