Assertion: arithmetic circuit | /r/CapableOf | compute polynomial f
Facets:
Source sentences:
text: (n\log d),} and later Baur and Strassen showed the following: given an arithmetic circuit of size s {\displaystyle s} computing a polynomial f , {\displaystyle f,} one can construct a new circuit of size at most O ( s ) {\displaystyle O(s)} that computes f {\displaystyle f} and all the n {\displaystyle n} partial derivatives of f .