| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4945945 | Journal of Symbolic Computation | 2017 | 32 Pages |
Abstract
Furthermore, for generic polynomial systems, we present an explicit formula for the estimation of the sparsity of one main multiplication matrix, and prove that its construction is free. With the asymptotic analysis of such sparsity, we are able to show that for generic systems the complexity above becomes O(6/nÏD2+nâ1n).
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Jean-Charles Faugère, Chenqi Mou,