The field of polynomial systems occupies a central role in computational mathematics, where the intricate interplay between algebra, geometry, and computational complexity is evident. Research in this ...

This paper presents a generalization of the Remez multiple-exchange (ME) algorithm for solving complex Chebyshev approximation by polynomials on the unit circle. The difficulties of implementing the ...

The most widely used technique for finding the largest or smallest values of a math function turns out to be a fundamentally difficult computational problem. Many aspects of modern applied research ...

Algorithms that zero in on solutions to optimization problems are the beating heart of machine reasoning. New results reveal surprising limits. Our lives are a succession of optimization problems.

What if the famous P vs NP problem isn’t just about algorithms but about the observers trying to solve them? Research ...

This is a preview. Log in through your library . Abstract We present a new complexity result on solving the Markov decision problem (MDP) with n states and a number of actions for each state, a ...