MST
2010
13 years 10 months ago
2010
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words,...
MST
2010
13 years 10 months ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
MST
2010
13 years 10 months ago
2010
We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an operator f : {0, 1}n → {0, 1}m as the logarithm of the maximu...