1379 search results - page 171 / 276 » The Complexity of the Annihilating Polynomial |
178
click to vote
ISAAC
2007
Springer
16 years 17 days ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
176
click to vote
ISSAC
2007
Springer
16 years 17 days ago
2007
Springer
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...
146
click to vote
ISSAC
2007
Springer
16 years 17 days ago
2007
Springer
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their po...
148
click to vote
SPIRE
2007
Springer
16 years 16 days ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
159
click to vote
TGC
2007
Springer
16 years 16 days ago
2007
Springer
Many techniques exist for statically computing properties of the evolution of processes expressed in process algebras. Static analysis has shown how to obtain useful results that c...