A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Lower bounds for algebraic computation trees of functions with finite domains
[chapter]
1991
Lecture Notes in Computer Science
Let F be a field. We flIld lower bounds on the depth of computation trees with the operations (+, -,X ,I) uE that compute funt;tions f :;1 -4~, where E is the set of all functions
doi:10.1007/3-540-54029-6_154
fatcat:otkefcsbzjhyxcggfn4hqaukj4