On the complexity of partial derivatives

DOI10.4230/LIPICS.STACS.2017.37MaRDI QIDQ4636636zbMATH OpenFDO

Authors Ignacio García Marco, Timothée Pecatte, Pascal Koiran, Stéphan Thomassé

Publication date 19 April 2018

Full work available at URL https://arxiv.org/abs/1607.05494

zbMATH Keywords

arithmetic circuitscounting complexitylower boundssimplicial complex

Mathematics Subject Classification ID

Combinatorial aspects of simplicial complexes (05E45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Partial derivatives in arithmetic complexity and beyond
• Lower bounds on arithmetic circuits via partial derivatives
• The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
• The shifted partial derivative complexity of elementary symmetric polynomials
• The complexity of partial derivatives

Cited in

(12)

• The complexity of partial derivatives
• Lower bounds on arithmetic circuits via partial derivatives
• Deterministic polynomial identity testing in non-commutative models
• Leibniz complexity of Nash functions on differentiations
• There is no efficient reverse derivation mode for discrete derivatives
• Partial derivatives in arithmetic complexity and beyond
• The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
• The polynomial method in circuit complexity applied to algorithm design (invited talk)
• scientific article; zbMATH DE number 5117352 (Why is no real title available?)
• scientific article; zbMATH DE number 3949711 (Why is no real title available?)
• Towards blackbox identity testing of log-variate circuits
• The shifted partial derivative complexity of elementary symmetric polynomials

This page was built for publication: On the complexity of partial derivatives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636636)