| 2011 | ||
|---|---|---|
| j6 | Guillaume Chèze: Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time. J. Complexity 27(2): 246-262 (2011) | |
| j5 | Guillaume Chèze, André Galligo, Bernard Mourrain, Jean-Claude Yakoubsohn: A subdivision method for computing nearest gcd with certification. Theor. Comput. Sci. 412(35): 4493-4503 (2011) | |
| 2010 | ||
| j4 | Guillaume Chèze: Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth Theorem. J. Complexity 26(4): 344-363 (2010) | |
| j3 | Cristina Bertone, Guillaume Chèze, André Galligo: Modular Las Vegas algorithms for polynomial absolute factorization. J. Symb. Comput. 45(12): 1280-1295 (2010) | |
| i4 | Guillaume Chèze: Nearly Optimal Algorithms for the Decomposition of Multivariate Rational Functions and the Extended Lüroth's Theorem. CoRR abs/1004.5285 (2010) | |
| i3 | Guillaume Chèze: Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time. CoRR abs/1009.2876 (2010) | |
| i2 | Guillaume Chèze: A recombination algorithm for the decomposition of multivariate rational functions. CoRR abs/1011.0972 (2010) | |
| 2009 | ||
| i1 | Laurent Busé, Guillaume Chèze, Salah Najib: Noether's forms for the study of non-composite rational functions and their spectrum. CoRR abs/0906.2925 (2009) | |
| 2007 | ||
| j2 | Guillaume Chèze, Grégoire Lecerf: Lifting and recombination techniques for absolute factorization. J. Complexity 23(3): 380-420 (2007) | |
| 2006 | ||
| j1 | Guillaume Chèze, André Galligo: From an approximate to an exact absolute polynomial factorization. J. Symb. Comput. 41(6): 682-696 (2006) | |
| 2004 | ||
| c1 | Guillaume Chèze: Absolute polynomial factorization in two variables and the knapsack problem. ISSAC 2004: 87-94 | |
| 1 | Cristina Bertone | |
| 2 | Laurent Busé | |
| 3 | André Galligo | |
| 4 | Grégoire Lecerf | |
| 5 | Bernard Mourrain | |
| 6 | Salah Najib | |
| 7 | Jean-Claude Yakoubsohn |
Data released under the ODC-BY 1.0 license — See also our legal information page