Name
Abstract | ||
|---|---|---|
In this paper we discuss several notions of decomposition for multivariate rational functions, and we present algorithms for decomposing multivariate rational functions over an arbitrary field. We also provide a very efficient method to decide if a unirational field has transcendence degree one, and in the affirmative case to compute the generator. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1006/jsco.2002.0529 | J. Symb. Comput. |
Keywords | DocType | Volume |
affirmative case,unirational field,multivariate rational function decomposition,efficient method,present algorithm,transcendence degree,arbitrary field,multivariate rational function | Journal | 33 |
Issue | ISSN | Citations |
5 | Journal of Symbolic Computation | 21 |
PageRank | References | Authors |
1.38 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jaime Gutierrez | 1 | 154 | 18.15 |
| Rosario Rubio | 2 | 65 | 5.62 |
| David Sevilla | 3 | 70 | 7.60 |