A new zero-test for formal power series

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2002, Pages 117-122

  Van der Hoeven, Joris ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIFFERENTIAL EQUATIONS; FUNCTIONS; POLES AND ZEROS;

ALGEBRAIC DIFFERENTIAL EQUATIONS; FORMAL POWER SERIES; ZERO TEST;

BOOLEAN ALGEBRA;

EID: 0036042387     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780506.780521     Document Type: Conference Paper

References (18)

1. On Schanuel's conjecture
2. Étude et implantation de quelques algorithmes en algèbre différentielle
3. Fast algorithms for manipulating formal power series
4. Power series solutions of algebraic differential equations
5. Decision problems for differential equations
6. A testing identities of series defined by algebraic partial differential equations
7. The uniformity conjecture
8. Algebraic properties of elementary functions in analysis
9. A differential-equations approach to functional equivalence
10. Zero-equivalence in function fields defined by algebraic differential equations
11. Complexity bounds for zero-test algorithms
12. Relax, but don't be too lazy
13. Complex transseries solutions to algebraic differential equations
14. Fast evaluation of holonomic functions near and in singularities
15. Zero-testing, witness conjectures and differential diophantine approximation