Abstract

Given a non-empty genus in nn dimensions with determinant dd, we give a randomized algorithm that outputs a quadratic form from this genus. The time complexity of the algorithm is poly(n,log⁡d)(n,\log d); assuming Generalized Riemann Hypothesis (GRH).

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.