53 research outputs found
Near NP-Completeness for Detecting p-adic Rational Roots in One Variable
We show that deciding whether a sparse univariate polynomial has a p-adic
rational root can be done in NP for most inputs. We also prove a
polynomial-time upper bound for trinomials with suitably generic p-adic Newton
polygon. We thus improve the best previous complexity upper bound of EXPTIME.
We also prove an unconditional complexity lower bound of NP-hardness with
respect to randomized reductions for general univariate polynomials. The best
previous lower bound assumed an unproved hypothesis on the distribution of
primes in arithmetic progression. We also discuss how our results complement
analogous results over the real numbers.Comment: 8 pages in 2 column format, 1 illustration. Submitted to a conferenc
Quantitative Aspects of Sums of Squares and Sparse Polynomial Systems
Computational algebraic geometry is the study of roots of polynomials and polynomial systems. We are familiar with the notion of degree, but there are other ways to consider a polynomial: How many variables does it have? How many terms does it have? Considering the sparsity of a polynomial means we pay special attention to the number of terms. One can sometimes profit greatly by making use of sparsity when doing computations by utilizing tools from linear programming and integer matrix factorization. This thesis investigates several problems from the point of view of sparsity. Consider a system F of n polynomials over n variables, with a total of n + k distinct exponent vectors over any local field L. We discuss conjecturally tight bounds on the maximal number of non-degenerate roots F can have over L, with all coordinates having fixed phase, as a function of n, k, and L only. In particular, we give new explicit systems with number of roots approaching the best known upper bounds. We also give a complete classification for when an n-variate n + 2-nomial positive polynomial can be written as a sum of squares of polynomials. Finally, we investigate the problem of approximating roots of polynomials from the viewpoint of sparsity by developing a method of approximating roots for binomial systems that runs more efficiently than other current methods. These results serve as building blocks for proving results for less sparse polynomial systems
On the factorization of polynomials over algebraic fields
SIGLEAvailable from British Library Document Supply Centre- DSC:DX86869 / BLDSC - British Library Document Supply CentreGBUnited Kingdo
- …