Year: 2014
Type: preprint
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).
Source: arXiv (Cornell University)
Authors: Dubey, Chandan, Holenstein, Thomas
Institutions: ETH Zurich, Institute of Theoretical Computer Science
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1891056070