arXiv (All)
open access
An Evaluation of Vertex Elimination Strategies for Algorithmic Differentiation
The algorithmic differentiation (AD) of mathematical functions can be interpreted as a sequence of vertex eliminations in an underlying directed acyclic graph. The problem of determining a minimum-cost elimination ordering, which we call Optimal Vertex Elimination, is NP-complete, and much effort ha
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Associativity and Commutativity in Equality Saturation#1156470
- Computational Simulation and Algorithm Analysis for Solving Combinatorial Optimization Problems in Graph Theory and Discrete Mathematics#246976
- The 11/6 supremum of the Wang-Sitters rounding scheme for graph balancing#998384
- Dense Interprocedural Dominance in Acyclic Graphs: Context Bounds and Compact Queries#1064362
- Odd and Even Harder Problems on Cycle-Factors#1104900
Record · ID 1324517
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive