A survey of techniques in applied computational complexity
From MaRDI portal
Publication:1224857
DOI10.1016/0771-050X(75)90005-4zbMath0324.65023MaRDI QIDQ1224857
Publication date: 1975
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to single equations (65H05) Algorithms in computer science (68W99)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Axioms and hulls
- A fast method for interpolation using preconditioning
- Fast modular transforms
- Remarks on the complexity of roundoff analysis
- A model for iterative computation
- A new upper bound on the complexity of derivative evaluation
- On computing reciprocals of power series
- Gaussian elimination is not optimal
- On optimum root-finding algorithms
- Fast multiplication of large numbers
- On multiplication of 2 \(\times\) 2 matrices
- Sur le calcul des produits de matrices. (Calculation of the product of matrices.)
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
- An algorithm for division of powerseries
- Berechnung und Programm. I
- Optimal algorithms for parallel polynomial evaluation
- Berechnung und Programm. II
- A bound on the multiplicative efficiency of iteration
- Berechnungen in partiellen Algebren endlichen Typs
- On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
- Maximal Stationary Iterative Methods for the Solution of Operator Equations
- Optimal Order and Efficiency for Iterations with Two Evaluations
- Toward Abstract Numerical Analysis
- Optimal Order of One-Point and Multipoint Iteration
- Evaluation of Rational Functions
- Simple Proofs of Lower Bounds for Polynomial Evaluation
- Parallel Iteration Methods
- The Computational Complexity of Elliptic Partial Differential Equations
- On the number of multiplications necessary to compute certain functions
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- An Overview of the Theory of Computational Complexity
- Computational Complexity of Iterative Processes
- On some topological properties of numerical algorithms
- Stability of Difference Equations and Convergence of Iterative Processes
- A Family of Fourth Order Methods for Nonlinear Equations
This page was built for publication: A survey of techniques in applied computational complexity
