The complexity of partial derivatives
From MaRDI portal
Publication:1171380
DOI10.1016/0304-3975(83)90110-XzbMath0498.68028MaRDI QIDQ1171380
Publication date: 1983
Published in: Theoretical Computer Science (Search for Journal in Brave)
root functions; determinant; matrix inversion; complexity of single power sums; single elementary symmetric functions
68Q25: Analysis of algorithms and problem complexity
65F40: Numerical computation of determinants
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
Computation of exact gradients in distributed dynamic systems, Subquadratic-time factoring of polynomials over finite fields, Adjoining Strategies for Multi-layered Programs, Faster Combinatorial Algorithms for Determinant and Pfaffian, A probabilistic algorithm to test local algebraic observability in polynomial time, A Gröbner free alternative for polynomial system solving, Some computational problems in linear algebra as hard as matrix multiplication, Definability and fast quantifier elimination in algebraically closed fields, The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations, Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators, Fast algorithms for the characteristic polynomial, The complexity of evaluating interpolation polynomials, A fast numerical algorithm for the composition of power series with complex coefficients, Complexity of parallel matrix computations, The trace invariant and matrix inversion, Feasible arithmetic computations: Valiant's hypothesis, The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms, Automatic computation of partial derivatives and rounding error estimates with applications to large-scale systems of nonlinear equations, Test complexity of generic polynomials, Efficient VLSI fault simulation, A minimal code list, Matrix inversion algorithms by means of automatic differentiation, Polar varieties, real equation solving, and data structures: the hypersurface case, Semi-algebraic complexity -- Additive complexity of matrix computational tasks, Algebraic and numerical techniques for the computation of matrix determinants, Easy lower bound for a strange computational model, Straight-line programs in geometric elimination theory, Computing the sign or the value of the determinant of an integer matrix, a complexity survey., Lower bound for the approximative complexity, Affine projections of symmetric polynomials., Fast computation of discrete invariants associated to a differential rational mapping, Complexity results for triangular sets, Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant, Semi-algebraic decision complexity, the real spectrum, and degree, Computing Frobenius maps and factoring polynomials, A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle, Optimal Jacobian accumulation is NP-complete, Change of order for regular chains in positive dimension, There is no efficient reverse derivation mode for discrete derivatives, Rigorous Sensitivity Analysis for Systems of Linear and Nonlinear Equations
Cites Work
