Term Graphs for Computing Derivatives in Imperative Languages (Q2867901): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Bisimilarity in term graph rewriting. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3474197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 755: ADOL-C / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Algorithms: Foundations and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3837998 / rank
 
Normal rank

Revision as of 04:06, 7 July 2024

scientific article
Language Label Description Also known as
English
Term Graphs for Computing Derivatives in Imperative Languages
scientific article

    Statements

    Term Graphs for Computing Derivatives in Imperative Languages (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 December 2013
    0 references
    automatic differentiation
    0 references
    computational graph
    0 references
    term graph
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references