About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Novák, Vilém
An algorithm for reduction of complexity of relations in a system of variables. (English). Aplikace matematiky, vol. 22 (1977), issue 6, pp. 418-424
MSC: 62-04, 62J05, 68Q25, 68W99 | Zbl 0391.68023 | DOI: 10.21136/AM.1977.103718
Keywords:
complexity of relations; cross relations; algorithms
Summary:
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.
References:
[1] J. Raichl: Programming for Computers. (Czech). Academia, Praha 1974.
[2] L. Beran: Groups and Lattices. (Czech). SNTL, Praha 1974. MR 0422393 | Zbl 0379.06001
Partner of
EuDML logo