Pages that link to "Item:Q1171380"
From MaRDI portal
The following pages link to The complexity of partial derivatives (Q1171380):
Displayed 40 items.
- Some computational problems in linear algebra as hard as matrix multiplication (Q685718) (← 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)
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators (Q923629) (← 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)
- 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)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle (Q2378541) (← links)
- Optimal Jacobian accumulation is NP-complete (Q2465656) (← links)
- Change of order for regular chains in positive dimension (Q2476011) (← links)
- There is no efficient reverse derivation mode for discrete derivatives (Q2576878) (← links)
- Rigorous Sensitivity Analysis for Systems of Linear and Nonlinear Equations (Q3479458) (← links)
- Computation of exact gradients in distributed dynamic systems (Q4391288) (← links)
- Subquadratic-time factoring of polynomials over finite fields (Q4396457) (← links)
- Adjoining Strategies for Multi-layered Programs (Q4806345) (← links)
- Faster Combinatorial Algorithms for Determinant and Pfaffian (Q5387794) (← links)
- A probabilistic algorithm to test local algebraic observability in polynomial time (Q5894826) (← links)
- A Gröbner free alternative for polynomial system solving (Q5938584) (← links)