A note on the computational complexity of chain rule differentiation

DOI10.1080/10556788.2023.2263809MaRDI QIDQ7238769zbMATH OpenFDO

Authors

Publication date 8 May 2026

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2023.2263809

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• Evaluating Derivatives
• First- and second-order optimality conditions for piecewise smooth objective functions
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Optimal Jacobian accumulation is NP-complete
• Progress on polynomial identity testing
• Reducibility among combinatorial problems
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives

This page was built for publication: A note on the computational complexity of chain rule differentiation

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