Abstract
In Heintz et al. (Electron. J. SADIO 1(1) (1998) 37), Castro et al. (Found., Comput. Math. (2003) to appear) and Pardo (Proceedings EACA’2000, 2000, pp. 25–51), the authors have shown that universal solving procedures require exponential running time. Roughly speaking, a universal solving procedure takes as input a system of multivariate polynomial equations and outputs complete symbolic information on the solution variety. Here, we introduce a non-universal solving procedure adapted to Generalised Pham Systems. The aim is to compute partial information of the variety defined by the input system. The Algorithm is based on an homotopic deformation and on a non-Archimedean lifting procedure from a non-singular zero of the homotopy curve. The complexity of the procedure is also stated and it depends on some intrinsic quantity called the deformation degree of the given input system.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
