Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs


Andrew Yao proved some lower bounds for algebraic computation trees with integer inputs. In his key result he proved bounds on the number of components of the leaf space of a homogeneous decision tree derived from a computation tree. In this paper we present a shorter and more conceptual proof. We introduce the concept of aregulated tree as a generalization… (More)
DOI: 10.1007/BF01200063


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics