Name
Title | ||
|---|---|---|
Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case |
Abstract | ||
|---|---|---|
This paper presents an algorithm for decomposing any positive-dimensional polynomial set into simple sets over an arbitrary finite field. The algorithm is based on some relationship established between simple sets and radical ideals, reducing the decomposition problem to the problem of computing the radicals of certain ideals. In addition to direct application of the algorithms of Matsumoto and Kemper, the algorithm of Fortuna and others is optimized and improved for the computation of radicals of special ideals. Preliminary experiments with an implementation of the algorithm in Maple and Singular are carried out to show the effectiveness and efficiency of the algorithm. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.tcs.2012.11.009 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
positive-dimensional case,radical ideal,polynomial set,decomposition problem,special ideal,preliminary experiment,arbitrary finite field,certain ideal,direct application,positive-dimensional polynomial,simple set | Journal | 468, |
ISSN | Citations | PageRank |
0304-3975 | 4 | 0.41 |
References | Authors | |
18 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chenqi Mou | 1 | 38 | 5.55 |
| Dongming Wang | 2 | 458 | 55.77 |
| Xiaoliang Li | 3 | 28 | 7.12 |