On the representation of rational functions of bounded complexity

AbstractThe main result of this article is the Representation Theorem which characterizes families of rational functions of bounded complexity by appropriate mappings. This description is not only independent of the characteristic of the underlying field but also of the specific complexity measure under consideration. As an application of the Representation Theorem we derive good lower complexity bounds