Pages that link to "Item:Q1171380"
From MaRDI portal
The following pages link to The complexity of partial derivatives (Q1171380):
Displaying 50 items.
- Randomized interior point methods for sampling and optimization (Q259600) (← links)
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (Q403098) (← links)
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set (Q464735) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- Fast linear homotopy to find approximate zeros of polynomial systems (Q626447) (← links)
- Lower bounds for the determinantal complexity of explicit low degree polynomials (Q639850) (← links)
- On a problem posed by Steve Smale (Q661924) (← links)
- Some computational problems in linear algebra as hard as matrix multiplication (Q685718) (← links)
- A backward automatic differentiation framework for reservoir simulation (Q723155) (← links)
- An algorithm for implicit interpolation (Q744017) (← links)
- Definability and fast quantifier elimination in algebraically closed fields (Q798314) (← links)
- The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations (Q800727) (← links)
- Faster combinatorial algorithms for determinant and Pfaffian (Q848938) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators (Q923629) (← links)
- On sign conditions over real multivariate polynomials (Q977180) (← links)
- Newton's method and FFT trading (Q979146) (← links)
- Deformation techniques for sparse systems (Q1029552) (← links)
- Fast algorithms for the characteristic polynomial (Q1058849) (← links)
- The complexity of evaluating interpolation polynomials (Q1081273) (← links)
- A fast numerical algorithm for the composition of power series with complex coefficients (Q1095657) (← links)
- Complexity of parallel matrix computations (Q1100892) (← links)
- The trace invariant and matrix inversion (Q1105373) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms (Q1121670) (← links)
- Automatic computation of partial derivatives and rounding error estimates with applications to large-scale systems of nonlinear equations (Q1123531) (← links)
- Test complexity of generic polynomials (Q1201154) (← links)
- Efficient VLSI fault simulation (Q1203708) (← links)
- A minimal code list (Q1287095) (← links)
- Matrix inversion algorithms by means of automatic differentiation (Q1334816) (← links)
- Polar varieties, real equation solving, and data structures: the hypersurface case (Q1361872) (← links)
- Semi-algebraic complexity -- Additive complexity of matrix computational tasks (Q1361878) (← links)
- Algebraic and numerical techniques for the computation of matrix determinants (Q1368466) (← links)
- Easy lower bound for a strange computational model (Q1377572) (← links)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← links)
- Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time (Q1683739) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- Lower bound for the approximative complexity (Q1822498) (← links)
- Affine projections of symmetric polynomials. (Q1872730) (← links)
- Fast computation of discrete invariants associated to a differential rational mapping (Q1878484) (← links)
- Complexity results for triangular sets (Q1878489) (← links)
- Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant (Q1903781) (← links)
- Semi-algebraic decision complexity, the real spectrum, and degree (Q1916424) (← links)
- Robust certified numerical homotopy tracking (Q1955526) (← links)
- The Chebyshev-Shamanskii method for solving systems of nonlinear equations (Q1955568) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
