A note on the computational complexity of chain rule differentiation

Optimization methods & software, vol. 41, pp. 386–393

Abstract

We generalize the proof of NP-completeness of Jacobian accumulation using a given number of floating-point operations to arbitrary order.

Authors 1

1. Uwe Naumann corresponding Aachen Software and Tools for Computational Engineering

   RWTH Aachen University

   Affiliation as printed

   Software and Tools for Computational Engineering, RWTH Aachen University

   Software and Tools for Computational Engineering, RWTH Aachen University, Aachen, Germany