What is it about?

We obtain bounds for the complexity of circuit realisation of the system of differentials of orders from one to k of an arbitrary elementary function in terms of the circuit complexity of this function. Similar bounds are obtained for the complexities of realisation of the Jacobian and Hessian matrices. We point out some applications to deduction of bounds for complexities of polynomials in several variables, linear transformations, and quadratic forms.

Featured Image

Read the Original

This page is a summary of: О сложности вычисления дифференциалов и градиентов, Дискретная математика, January 2005, Steklov Mathematical Institute,
DOI: 10.4213/dm115.
You can read the full text:

Read

Contributors

The following have contributed to this page