Sign Up to like & get
recommendations!
1
Published in 2021 at "Foundations of Computational Mathematics"
DOI: 10.1007/s10208-020-09453-0
Abstract: We present a probabilistic Las Vegas algorithm for solving sufficiently generic square polynomial systems over finite fields. We achieve a nearly quadratic running time in the number of solutions, for densely represented input polynomials. We…
read more here.
Keywords:
complexity exponent;
exponent polynomial;
polynomial system;
complexity ... See more keywords