The following pages link to Guillaume Chèze (Q607050):
Displaying 22 items.
- Modular Las Vegas algorithms for polynomial absolute factorization (Q607052) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- On the total order of reducibility of a pencil of algebraic plane curves (Q661865) (← links)
- Specializations of indecomposable polynomials (Q692611) (← links)
- (Q984985) (redirect page) (← links)
- Indecomposability of polynomials via Jacobian matrix (Q984987) (← links)
- Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem (Q990817) (← links)
- How to cut a cake with a Gram matrix (Q1625485) (← links)
- Topological aggregation, the twin paradox and the No Show paradox (Q1704047) (← links)
- Bounding the number of remarkable values via Jouanolou's theorem (Q2017886) (← links)
- Symbolic computations of first integrals for polynomial vector fields (Q2194771) (← links)
- How to share a cake with a secret agent (Q2334821) (← links)
- Cake cutting: explicit examples for impossibility results (Q2334852) (← links)
- Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
- Existence of a simple and equitable fair division: a short proof (Q2406943) (← links)
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time (Q2431341) (← links)
- Darboux theory of integrability in the sparse case (Q2449616) (← links)
- From an approximate to an exact absolute polynomial factorization (Q2457357) (← links)
- Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields (Q2792368) (← links)
- A recombination algorithm for the decomposition of multivariate rational functions (Q2840631) (← links)
- Computing nearest Gcd with certification (Q2959015) (← links)
- Noether forms for the study of non-composite rational functions and their spectrum (Q3079950) (← links)
