Towards computing non algebraic cylindrical decompositions
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
The elementary constant problem
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
A zero structure theorem for exponential polynomials
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Deciding linear-trigonometric problems
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Computer algebra handbook
| Hi-index | 0.00 |
The Khovanskii finiteness theorem calculates an upper bound for the number of connected components of the intersection of an algebraic set with a Pfaff manifold in R^n. This paper uses the algebraic methods of Wu Wen-tsun to give an elementary pioof of Khovanskii's theorem. An extension of the Wu-Ritt zero structure theorem is also obtained.