On the complexity of the gradient of a rational function

MaRDI QIDQ3115654zbMATH OpenFDO

Authors I. S. Sergeev

Publication date 10 February 2012

zbMATH Keywords

algebraic complexitytransposition principle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 3890725
• On the complexity of calculation of differentials and gradients
• scientific article; zbMATH DE number 3934790
• Fast method to compute the scalar product of gradient and given vector
• The complexity of partial derivatives

Cited in

(4)

• scientific article; zbMATH DE number 3890725 (Why is no real title available?)
• Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average
• scientific article; zbMATH DE number 3637739 (Why is no real title available?)
• On the complexity of calculation of differentials and gradients

This page was built for publication: On the complexity of the gradient of a rational function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115654)