Learn More
Starting point of our work is a previous paper by Flarup, Koiran, and Lyaudet [5]. There the expressive power of certain families of polynomials is investigated. Among other things it is shown that polynomials arising as permanents of bounded tree-width matrices have the same expressiveness as polynomials given via arithmetic formulas. A natural question is(More)
We study the size of OBDDs (ordered binary decision diagrams) for representing the adjacency function fG of a graph G on n vertices. Our results are as follows:-for graphs of bounded tree-width there is an OBDD of size O(log n) for fG that uses encodings of size O(log n) for the vertices;-for graphs of bounded clique-width there is an OBDD of size O(n) for(More)