A note on the computational complexity of chain rule differentiation.
Saved in:
| Title: | A note on the computational complexity of chain rule differentiation. |
|---|---|
| Authors: | Naumann, U.1 (AUTHOR) naumann@stce.rwth-aachen.de |
| Source: | Optimization Methods & Software. Apr2026, Vol. 41 Issue 2, p386-393. 8p. |
| Subjects: | NP-complete problems, Jacobian matrices, Floating-point arithmetic, Differentiation (Mathematics), Computational complexity |
| Abstract: | We generalize the proof of NP-completeness of Jacobian accumulation using a given number of floating-point operations to arbitrary order. [ABSTRACT FROM AUTHOR] |
| Copyright of Optimization Methods & Software is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | We generalize the proof of NP-completeness of Jacobian accumulation using a given number of floating-point operations to arbitrary order. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 10556788 |
| DOI: | 10.1080/10556788.2023.2263809 |
