Skip to Main Content
The ever increasing size of integrated circuits results in large problem sizes during synthesis and verification of such designs. Recently Taylor expansion diagrams (TEDs) were introduced as a data structure to cope with large problem instances. TEDs allow us to exploit high level information in the representation of functions. In this paper, the basic TED operations are analyzed from a complexity point of view. Suggestions for optimizations of the originally proposed algorithms are made.