complexity of relations; cross relations; algorithms
Let us have a system of variables, among which there are complicated dependences. Assuming reflexivity and transitivity of the relation "$X$ depends on $Y$", a simple algorithm is proposed which produces all dependences in an optimized way, without losing information.
 J. Raichl: Programming for Computers. (Czech). Academia, Praha 1974.