Pages that link to "Item:Q1171380"
From MaRDI portal
The following pages link to The complexity of partial derivatives (Q1171380):
Displaying 50 items.
- Lower bounds for matrix factorization (Q2041242) (← links)
- Lower bounds for arithmetic circuits via the Hankel matrix (Q2051372) (← links)
- A geometric approach to homomorphic secret sharing (Q2061949) (← links)
- Bit complexity for computing one point in each connected component of a smooth real algebraic set (Q2100045) (← links)
- Exact linear reduction for rational dynamical systems (Q2112154) (← links)
- Limitations of sums of bounded read formulas and ABPs (Q2117084) (← links)
- Non-intrusive model reduction of large-scale, nonlinear dynamical systems using deep learning (Q2127404) (← links)
- Sparse polynomial interpolation based on derivatives (Q2156377) (← links)
- Quadratic lower bounds for algebraic branching programs and formulas (Q2159469) (← links)
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q2204092) (← links)
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844) (← links)
- Black-box learning of multigrid parameters (Q2291999) (← links)
- Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree (Q2294435) (← links)
- A quadratic lower bound for homogeneous algebraic branching programs (Q2323359) (← links)
- Leibniz complexity of Nash functions on differentiations (Q2330984) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← 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)
- Lower bounds for the circuit size of partially homogeneous polynomials (Q2405138) (← links)
- Optimal Jacobian accumulation is NP-complete (Q2465656) (← links)
- Change of order for regular chains in positive dimension (Q2476011) (← links)
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant (Q2514144) (← links)
- There is no efficient reverse derivation mode for discrete derivatives (Q2576878) (← links)
- A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
- Term graphs for computing derivatives in imperative languages (Q2867901) (← links)
- Partial derivatives in arithmetic complexity and beyond (Q2872492) (← links)
- The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials (Q2946403) (← links)
- On the Power of Homogeneous Depth 4 Arithmetic Circuits (Q2968157) (← links)
- Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845) (← links)
- Smale 17th Problem: Advances and Open Directions (Q3380357) (← links)
- Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials (Q3392951) (← links)
- Rigorous Sensitivity Analysis for Systems of Linear and Nonlinear Equations (Q3479458) (← links)
- (Q3719829) (← links)
- Computation of exact gradients in distributed dynamic systems (Q4391288) (← links)
- Subquadratic-time factoring of polynomials over finite fields (Q4396457) (← links)
- (Q4612482) (← links)
- On the complexity of partial derivatives (Q4636636) (← links)
- Adjoining Strategies for Multi-layered Programs (Q4806345) (← links)
- Notes on Hazard-Free Circuits (Q4986809) (← links)
- On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models (Q4988917) (← links)
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness (Q4993271) (← links)
- Probing a set of hyperplanes by lines and related problems (Q5060099) (← links)
- (Q5090938) (← links)
- (Q5092414) (← links)
- A quadratic lower bound for algebraic branching programs (Q5092449) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- Determinant-Preserving Sparsification of SDDM Matrices (Q5117381) (← links)
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q5121899) (← links)
- (Q5121900) (← links)
