scientific article; zbMATH DE number 7559090

DOI10.4230/LIPIcs.ITCS.2019.47MaRDI QIDQ5090425

Markus Bläser, Gorav Jindal

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

power seriessymmetric polynomialsNewton's iterationarithmetic complexityelementary symmetric polynomialsarithmetic circuits

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ Schur polynomials do not have small formulas if the determinant does not ⋮ Computing critical points for invariant algebraic systems

Cites Work

• Unnamed Item
• Evaluation properties of invariant polynomials
• Solving multivariate algebraic equation by Hensel construction
• Completeness and reduction in algebraic complexity theory
• Algebraic Complexity Classes
• Short presentations for alternating and symmetric groups
• On the Complexity of Numerical Analysis
• All Algebraic Functions Can Be Computed Fast
• The Fundamental Theorem on Symmetric Polynomials: History's First Whiff of Galois Theory
• EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS
• Computational Complexity

This page was built for publication: