The complexity of partial derivatives
From MaRDI portal
Recommendations
Cites work
- An Extension of Strassen’s Degree Bound
- Berechnung und Programm. I
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
- Gaussian elimination is not optimal
- scientific article; zbMATH DE number 3685447 (Why is no real title available?)
- scientific article; zbMATH DE number 3744549 (Why is no real title available?)
- scientific article; zbMATH DE number 3461412 (Why is no real title available?)
- scientific article; zbMATH DE number 3628385 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
Cited in
(only showing first 100 items - show all)- Deformation techniques for sparse systems
- 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 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.
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- 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
- Robust certified numerical homotopy tracking
- The Chebyshev-Shamanskii method for solving systems of nonlinear equations
- Limit complexities revisited
- Lower bounds for matrix factorization
- Lower bounds for arithmetic circuits via the Hankel matrix
- A geometric approach to homomorphic secret sharing
- Bit complexity for computing one point in each connected component of a smooth real algebraic set
- Exact linear reduction for rational dynamical systems
- Limitations of sums of bounded read formulas and ABPs
- Non-intrusive model reduction of large-scale, nonlinear dynamical systems using deep learning
- Sparse polynomial interpolation based on derivatives
- Quadratic lower bounds for algebraic branching programs and formulas
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- Black-box learning of multigrid parameters
- Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree
- A quadratic lower bound for homogeneous algebraic branching programs
- Leibniz complexity of Nash functions on differentiations
- Unifying known lower bounds via geometric complexity theory
- Computing Frobenius maps and factoring polynomials
- A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle
- Lower bounds for the circuit size of partially homogeneous polynomials
- Optimal Jacobian accumulation is NP-complete
- Change of order for regular chains in positive dimension
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant
- There is no efficient reverse derivation mode for discrete derivatives
- Randomized interior point methods for sampling and optimization
- A Selection of Lower Bounds for Arithmetic Circuits
- Term graphs for computing derivatives in imperative languages
- Partial derivatives in arithmetic complexity and beyond
- The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
- On the power of homogeneous depth 4 arithmetic circuits
- Permanent does not have succinct polynomial size arithmetic circuits of constant depth
- On the complexity of the gradient of a rational function
- Smale 17th Problem: Advances and Open Directions
- Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
- Rigorous Sensitivity Analysis for Systems of Linear and Nonlinear Equations
- scientific article; zbMATH DE number 3949711 (Why is no real title available?)
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
- Computation of exact gradients in distributed dynamic systems
- Subquadratic-time factoring of polynomials over finite fields
- scientific article; zbMATH DE number 7009617 (Why is no real title available?)
- On the complexity of partial derivatives
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
- Adjoining Strategies for Multi-layered Programs
- Lower bounds for tropical circuits and dynamic programs
- Notes on hazard-free circuits
- On proving parameterized size lower bounds for multilinear algebraic models
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
- Probing a set of hyperplanes by lines and related problems
- Quasipolynomial hitting sets for circuits with restricted parse trees
- Lower bounds for multilinear order-restricted ABPs
- A quadratic lower bound for algebraic branching programs
- Lower bounds for matrix factorization
- A super-quadratic lower bound for depth four arithmetic circuits
- Determinant-preserving sparsification of SDDM matrices
- scientific article; zbMATH DE number 7250151 (Why is no real title available?)
- scientific article; zbMATH DE number 7250152 (Why is no real title available?)
- scientific article; zbMATH DE number 7250153 (Why is no real title available?)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
- Faster Combinatorial Algorithms for Determinant and Pfaffian
- Fast computation of zeros of polynomial systems with bounded degree under finite-precision
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
- Algebraic independence in positive characteristic: a p-adic calculus
- On the complexity of calculation of differentials and gradients
- A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
- Non-commutative circuits and the sum-of-squares problem
- A probabilistic algorithm to test local algebraic observability in polynomial time
- Lower bounds for special cases of syntactic multilinear ABPs
- A Gröbner free alternative for polynomial system solving
- Fast Algorithms for Discrete Differential Equations
This page was built for publication: The complexity of partial derivatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1171380)
