On lower bounds for optimal Jacobian accumulation
From MaRDI portal
Publication:4685609
Recommendations
- On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs
- scientific article; zbMATH DE number 1269473
- scientific article; zbMATH DE number 140023
- Markowitz-Type Heuristics for Computing Jacobian Matrices Efficiently
- Optimal Jacobian accumulation is NP-complete
Cites work
- A Note on the NP-Completeness of Vertex Elimination on Directed Graphs
- Algorithmic Aspects of Vertex Elimination on Directed Graphs
- Augmented non-quadratic penalty algorithms
- Computational Graphs and Rounding Error
- Evaluating Derivatives
- On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs
- OpenAD/F
- Optimal Jacobian accumulation is NP-complete
Cited in
(5)- On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs
- Stochastic Algorithms: Foundations and Applications
- An integer programming approach to optimal derivative accumulation
- scientific article; zbMATH DE number 5503711 (Why is no real title available?)
- Optimal Jacobian accumulation is NP-complete
This page was built for publication: On lower bounds for optimal Jacobian accumulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4685609)