A note on the computational complexity of chain rule differentiation

被引：0

|

作者：

Naumann, U. ^{[1
,2
]}

机构：

[1] Rhein Westfal TH Aachen, Software & Tools Computat Engn, Aachen, Germany

[2] Rhein Westfal TH Aachen, Software & Tools Computat Engn, D-52062 Aachen, Germany

来源：

OPTIMIZATION METHODS & SOFTWARE | 2023年

关键词：

Chain rule of differentiation; computational complexity; algorithmic differentiation;

D O I：

10.1080/10556788.2023.2263809

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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

引用

收藏

页数：8

相关论文

共 50 条

[31] From Query Complexity to Computational Complexity
Dobzinski, Shahar
Vondrak, Jan
STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 1107 - 1116
[32] Natural complexity, computational complexity and depth
Machta, J.
CHAOS, 2011, 21 (03)
[33] A NOTE ON THE DURHAM RULE
KOESSLER, M
AMERICAN BAR ASSOCIATION JOURNAL, 1963, 49 (10): : 926 - 926
[34] A NOTE ON WARING RULE
EDWARDS, AWF
HISTORIA MATHEMATICA, 1991, 18 (02) : 177 - 177
[35] A NOTE ON HOTELLING RULE
PFINGSTEN, A
RESOURCES POLICY, 1986, 12 (01) : 73 - 74
[36] NOTE ON SIMPSONS RULE
不详
AMERICAN MATHEMATICAL MONTHLY, 1969, 76 (08): : 929 - &
[37] A NOTE ON NANSON RULE
NIOU, EMS
PUBLIC CHOICE, 1987, 54 (02) : 191 - 193
[38] A NOTE ON WHITHAMS RULE
CHISNELL, RF
JOURNAL OF FLUID MECHANICS, 1965, 22 : 103 - &
[39] The computational complexity of QoS measures for orchestrationsThe computational complexity of QoS measures
Joaquim Gabarro
Sergio Leon-Gaixas
Maria Serna
Journal of Combinatorial Optimization, 2017, 34 : 1265 - 1301
[40] Computational complexity of Markov chain Monte Carlo methods for finite Markov random fields
Frigessi, A
Martinelli, F
Stander, J
BIOMETRIKA, 1997, 84 (01) : 1 - 18

← 1 2 3 4 5 →