An algorithm for reduction of complexity of relations in a system of variables

Vilém Novák

Aplikace matematiky (1977)

  • Volume: 22, Issue: 6, page 418-424
  • ISSN: 0862-7940

Abstract

top
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.

How to cite

top

Novák, Vilém. "An algorithm for reduction of complexity of relations in a system of variables." Aplikace matematiky 22.6 (1977): 418-424. <http://eudml.org/doc/15027>.

@article{Novák1977,
abstract = {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.},
author = {Novák, Vilém},
journal = {Aplikace matematiky},
keywords = {complexity of relations; cross relations; algorithms; Complexity of Relations; Cross Relations; Algorithms},
language = {eng},
number = {6},
pages = {418-424},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {An algorithm for reduction of complexity of relations in a system of variables},
url = {http://eudml.org/doc/15027},
volume = {22},
year = {1977},
}

TY - JOUR
AU - Novák, Vilém
TI - An algorithm for reduction of complexity of relations in a system of variables
JO - Aplikace matematiky
PY - 1977
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 22
IS - 6
SP - 418
EP - 424
AB - 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.
LA - eng
KW - complexity of relations; cross relations; algorithms; Complexity of Relations; Cross Relations; Algorithms
UR - http://eudml.org/doc/15027
ER -

References

top
  1. J. Raichl, Programming for Computers, (Czech). Academia, Praha 1974. (1974) 
  2. L. Beran, Groups and Lattices, (Czech). SNTL, Praha 1974. (1974) Zbl0379.06001MR0422393

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.