Pages that link to "Item:Q4636636"
From MaRDI portal
The following pages link to On the complexity of partial derivatives (Q4636636):
Displaying 11 items.
- The complexity of partial derivatives (Q1171380) (← links)
- Lower bounds on arithmetic circuits via partial derivatives (Q1377574) (← links)
- Deterministic polynomial identity testing in non-commutative models (Q1781113) (← links)
- Leibniz complexity of Nash functions on differentiations (Q2330984) (← links)
- There is no efficient reverse derivation mode for discrete derivatives (Q2576878) (← links)
- Partial derivatives in arithmetic complexity and beyond (Q2872492) (← links)
- The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials (Q2946403) (← links)
- The polynomial method in circuit complexity applied to algorithm design (invited talk) (Q3299223) (← links)
- (Q3416397) (← links)
- (Q3719829) (← links)
- Towards blackbox identity testing of log-variate circuits (Q5002729) (← links)