1383 search results - page 36 / 277 » On the Complexity of the Interlace Polynomial |
126
click to vote
LICS
2007
IEEE
16 years 12 days ago
2007
IEEE
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...
150
click to vote
FCT
2003
Springer
15 years 11 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
183
click to vote
ANTS
2010
Springer
15 years 10 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...
129
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
162
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
In the paper, we develop a systematic methodology for modeling sampled interconnect frequency response data based on spline interpolation. Through piecewise polynomial interpolatio...