230 search results - page 12 / 46 » Faster algorithms for the characteristic polynomial |
ICDM
2005
IEEE
15 years 3 months ago
2005
IEEE
Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as po...
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
For counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof’s algorithm. We present several improvements on...
STOC
2007
ACM
15 years 10 months ago
2007
ACM
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
ISSAC
2005
Springer
15 years 3 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
114
click to vote
ASPDAC
2008
ACM
14 years 11 months ago
2008
ACM
In the nanometer manufacturing region, process variation causes significant uncertainty for circuit performance verification. Statistical static timing analysis (SSTA) is thus dev...