Algebraic complexity of computing polynomial zeros

This publication has 17 references indexed in Scilit:

• Polynomial division and its computational complexity
  Journal of Complexity, 1986
• Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
  SIAM Journal on Computing, 1986
• On the efficiency of algorithms of analysis
  Bulletin of the American Mathematical Society, 1985
• Computational complexity. On the geometry of polynomials and a theory of cost. I
  Annales Scientifiques de lʼÉcole Normale Supérieure, 1985
• Fast algorithms for the characteristics polynomial
  Theoretical Computer Science, 1985
• Parallel Solution of Certain Toeplitz Linear Systems
  SIAM Journal on Computing, 1984
• On computing the determinant in small parallel time using a small number of processors
  Information Processing Letters, 1984
• Fast parallel matrix and GCD computations
  Information and Control, 1982
• The fundamental theorem of algebra and complexity theory
  Bulletin of the American Mathematical Society, 1981
• Power Sum Method and the Approximative Solution of Algebraic Equations
  Mathematics of Computation, 1975