Complexity and real computation
Complexity and real computation
Asymptotic acceleration of solving multivariate polynomial systems of equations
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Complexity estimates depending on condition and round-off error
Journal of the ACM (JACM)
The real dimension problem is NPR -complete
Journal of Complexity
Fast Multiple-Precision Evaluation of Elementary Functions
Journal of the ACM (JACM)
On solving univariate sparse polynomials in logarithmic time
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Convergent SDP-Relaxations in Polynomial Optimization with Sparsity
SIAM Journal on Optimization
Factoring bivariate sparse (lacunary) polynomials
Journal of Complexity
On exact and approximate interpolation of sparse rational functions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Computing the global optimum of a multivariate polynomial over the reals
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
Computational Optimization and Applications
Symbolic-numeric sparse interpolation of multivariate polynomials
Journal of Symbolic Computation
Faster real feasibility via circuit discriminants
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
On the Complexity of Numerical Analysis
SIAM Journal on Computing
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
SIAM Journal on Optimization
Hi-index | 5.23 |
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and inequality checks, and are quadratic in n and the logarithm of a certain condition number. For the special case of n-variate (n+2)-nomials with integer exponents, the log of our condition number is sub-quadratic in the sparse size. The best previous complexity bounds were exponential in the sparse size, even for n fixed. Along the way, we partially extend the theory of Viro diagrams and A-discriminants to real exponents. We also show that, for any fixed @d0, deciding whether the supremum of an n-variate (n+n^@d)-nomial exceeds a given number is NP"R-complete.