Sciweavers

IJAC
2006
87views more  IJAC 2006»
13 years 5 months ago
Evaluation Properties of Symmetric Polynomials
By the fundamental theorem of symmetric polynomials, if P Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(1, . . . , n), where 1, . . . , n are the elementary symmet...
Pierrick Gaudry, Éric Schost, Nicolas M. Th...
ENTCS
2006
113views more  ENTCS 2006»
13 years 5 months ago
A Large-Scale Experiment in Executing Extracted Programs
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
Luís Cruz-Filipe, Pierre Letouzey
ENTCS
2008
91views more  ENTCS 2008»
13 years 5 months ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra