394 search results - page 19 / 79 » Computing Minimal Polynomials of Matrices |
194
Voted
DNA
2006
Springer
15 years 9 months ago
2006
Springer
Minimal parallelism was recently introduced [3] as a way the rules of a P system are used: from each set of applicable rules associated to the same membrane, at least one must be a...
169
Voted
JALC
2006
15 years 5 months ago
2006
Minimal parallelism was recently introduced [3] as a way of using the rules of a P system: from each set of applicable rules associated to a membrane, at least one rule must be ap...
145
Voted
STOC
1998
ACM
15 years 10 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
145
click to vote
COCO
2006
Springer
15 years 7 months ago
2006
Springer
We study the identity testing problem for depth 3 arithmetic circuits ( circuit). We give the first deterministic polynomial time identity test for circuits with bounded top fanin...
147
click to vote
ISSAC
2004
Springer
15 years 11 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...