scientific article
From MaRDI portal
Publication:3823143
zbMath0669.68036MaRDI QIDQ3823143
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitycomputer algebracomplexity of equation solvingcomputational treatment of algebraic equations
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Numerical linear algebra (65Fxx) Algorithms in computer science (68W99)
Related Items
Semi-algebraic complexity -- Additive complexity of matrix computational tasks, Unnamed Item, On efficiently solvable cases of quantum \(k\)-SAT, A fast and stable algorithm for splitting polynomials, On the geometry of Graeffe iteration, Nearly optimal computations with structured matrices, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)]
