In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-S...
Smale's 17th Problem asks "Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the s...
We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to...
Bisubmodular functions are a natural "directed", or "signed", extension of submodular functions with several applications. Recently Fujishige and Iwata showed ...
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...