相关论文: Polynomial root-finding algorithms and branched co…

Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…

Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity…

We give practical, efficient algorithms that automatically determine the asymptotic distributed round complexity of a given locally checkable graph problem in the $[\Theta(\log n), \Theta(n)]$ region, in two settings. We present one…

We approximate the d complex zeros of a univariate polynomial p(x) of a degree d or those zeros that lie in a fixed region of interest on the complex plane such as a disc or a square. Our divide and conquer algorithm of STOC 1995 supports…

There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object that encodes many of the existing objects that have…

The Newton-Raphson (N-R) method is useful to find the roots of a polynomial of degree n. However, this method is limited since it diverges for the case in which polynomials only have complex roots if a real initial condition is taken. In…

An algorithm based on the Ehrlich-Aberth root-finding method is presented for the computation of the eigenvalues of a T-palindromic matrix polynomial. A structured linearization of the polynomial represented in the Dickson basis is…

We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree $n$ over a finite field $\F_q$, the average-case complexity of our algorithm is an expected $O(n^{1 + o(1)} \log^{2 +…

We consider a natural generalization of an abelian Hidden Subgroup Problem where the subgroups and their cosets correspond to graphs of linear functions over a finite field F with d elements. The hidden functions of the generalized problem…

When exploring the literature, it can be observed that the operator obtained when applying \textit{Newton-like} root finding algorithms to the quadratic polynomials $z^2-c$ has the same form regardless of which algorithm has been used. In…

We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algebraic numbers. One motivation is to explain the method's good…

We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank $2$ Drinfeld modules. The first algorithm estimates the degree of an irreducible factor of a polynomial from…

As showed in (Fiedler, 1990), any polynomial can be expressed as a characteristic polynomial of a complex symmetric arrowhead matrix. This expression is not unique. If the polynomial is real with only real distinct roots, the matrix can be…

Computing the roots of a univariate polynomial is a fundamental and long-studied problem of computational algebra with applications in mathematics, engineering, computer science, and the natural sciences. For isolating as well as for…

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

We describe several algorithms for computing $e$-th roots of elements in a number field $K$, where $e$ is an odd prime-power integer. In particular we generalize Couveignes' and Thom\'e's algorithms originally designed to compute…

We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…

New methods for $D$-decomposition analysis are presented. They are based on topology of real algebraic varieties and computational real algebraic geometry. The estimate of number of root invariant regions for polynomial parametric families…

Fewnomial theory began with explicit bounds -- solely in terms of the number of variables and monomial terms -- on the number of real roots of systems of polynomial equations. Here we take the next logical step of investigating the…

In this note we study the number of quantum queries required to identify an unknown multilinear polynomial of degree d in n variables over a finite field F_q. Any bounded-error classical algorithm for this task requires Omega(n^d) queries…