54 search results - page 1 / 11 » Computing Sums of Radicals in Polynomial Time |
FOCS
1991
IEEE
13 years 8 months ago
1991
IEEE
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
FSTTCS
2010
Springer
13 years 3 months ago
2010
Springer
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
CG
2006
Springer
13 years 9 months ago
2006
Springer
We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear progra...
SIAMJO
2000
13 years 5 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...