On the complexity of partial derivatives

DOI10.4230/LIPICS.STACS.2017.37zbMATH Open1402.68095arXiv1607.05494MaRDI QIDQ4636636FDOQ4636636

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

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

zbMATH Keywords

simplicial complexlower boundsarithmetic circuitscounting complexity

Mathematics Subject Classification ID

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

Cited In (9)

• Title not available (Why is that?)
• There is no efficient reverse derivation mode for discrete derivatives
• Title not available (Why is that?)
• The complexity of partial derivatives
• Leibniz complexity of Nash functions on differentiations
• The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
• Partial derivatives in arithmetic complexity and beyond
• Title not available (Why is that?)
• Deterministic polynomial identity testing in non-commutative models

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)