Lower bounds for algebraic computation trees of functions with finite domains [chapter]

Nader H. Bshouty
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