Generating a Quadratic Forms from a Given Genus
classification
💻 cs.DS
math.NTmath.RA
keywords
genusalgorithmgivenquadraticassumingcomplexitydeterminantdimensions
read the original abstract
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,\log d)$; assuming Generalized Riemann Hypothesis (GRH).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.