On the assignment complexity of uniform trees
Hongzhong Wu · 1993
This paper discusses the assignment complexity of the uniform tree, which is made up of identical cells realizimlg a function ~.Theassignment complexity ofatreeis detive function, then it is either ~(1.) or ~(lg n) assignable.