Name
Abstract | ||
|---|---|---|
We present an inversion algorithm for nonsingular n × n matrices whose entries are degree d polynomials over a field. The algorithm is deterministic and, when n is a power of two, requires O ∼ (n3d) field operations for a generic input; the soft-O notation O∼ indicates some missing log(nd) factors. Up to such logarithmic factors, this asymptotic complexity is of the same order as the number of distinct field elements necessary to represent the inverse matrix. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.jco.2004.03.005 | J. Complexity |
Keywords | DocType | Volume |
field operation,Matrix inversion,missing log,logarithmic factor,Polynomial matrix,n matrix,optimal computation,inverse matrix,distinct field element,inversion algorithm,generic input,nonsingular n,polynomial matrix,asymptotic complexity,Minimal kernel basis,matrix inversion,minimal kernel basis,generic polynomial matrix | Journal | 21 |
Issue | ISSN | Citations |
1 | Journal of Complexity | 16 |
PageRank | References | Authors |
1.25 | 12 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Claude-Pierre Jeannerod | 1 | 224 | 22.05 |
| Gilles Villard | 2 | 565 | 48.04 |