1204 search results - page 59 / 241 » Termination of Polynomial Programs |
SIAMJO
2010
14 years 7 months ago
2010
We present a general semidefinite relaxation scheme for general n-variate quartic polynomial optimization under homogeneous quadratic constraints. Unlike the existing sum-of-squar...
IPL
2008
15 years 18 days ago
2008
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
85
Voted
ICCAD
1996
IEEE
15 years 4 months ago
1996
IEEE
Although numerous methods have been proposed for interconnect simulation, no single model exists for all kind of transmission line problems. This paper presents a new, single, gen...
122
click to vote
ANTS
2010
Springer
15 years 4 months ago
2010
Springer
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
87
Voted
CORR
2010
Springer
15 years 20 days ago
2010
Springer
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...