2 papers
cs.DS2012
Chain Rotations: a New Look at Tree Distance
Fabrizio Luccio, Linda Pagli
As well known the rotation distance D(S,T) between two binary trees S, T of n vertices is the minimum number of rotations of pairs of vertices to transform S into T. We introduce t…
cs.DM2012
Compact DSOP and partial DSOP Forms
Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio +1
Given a Boolean function f on n variables, a Disjoint Sum-of-Products (DSOP) of f is a set of products (ANDs) of subsets of literals whose sum (OR) equals f, such that no two produ…