Some combinatorial characteristics of closure operations
The aim of this paper investigates some combinatorial characteristics of minimal key and antikey of closure operations. We also give effective algorithms finding minimal keys and antikeys of closure operations. We estimate these algorithms. Some remarks on the closeness of closure operations class u...
Збережено в:
| Дата: | 2019 |
|---|---|
| Автори: | , |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Lugansk National Taras Shevchenko University
2019
|
| Теми: | |
| Онлайн доступ: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/470 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Algebra and Discrete Mathematics |
Репозиторії
Algebra and Discrete Mathematics| Резюме: | The aim of this paper investigates some combinatorial characteristics of minimal key and antikey of closure operations. We also give effective algorithms finding minimal keys and antikeys of closure operations. We estimate these algorithms. Some remarks on the closeness of closure operations class under the union and direct product operations are also studied in this paper. |
|---|