A lower bound for the complexity of information networks for one partial order relation
E. E. Gasanov · Discrete Mathematics and Applications · 1996
Article A lower bound for the complexity of information networks for one partial order relation was published on January 1, 1996 in the journal Discrete Mathematics and Applications (volume 6, issue 6).