1092 search results - page 64 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
129
click to vote
JSC
2006
15 years 5 months ago
2006
For a polynomial ring R = k[x1, ..., xn], we present a method to compute the characteristic cycle of the localization Rf for any nonzero polynomial f R that avoids a direct comput...
148
Voted
ISSAC
2009
Springer
16 years 12 days ago
2009
Springer
We study systems of higher-order linear differential equations having a regular singularity at the origin. Using the properties of matrix polynomials, we develop efficient method...
172
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
148
Voted
ISSAC
2005
Springer
15 years 11 months ago
2005
Springer
We study the multiplication of multivariate power series. We show that over large enough fields, the bilinear complexity of the product modulo a monomial ideal M is bounded by th...
164
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...