SOME COMBINATORIAL PROBLEMS ON BINARY MATRICES IN PROGRAMMING COURSES
The study proves the existence of an algorithm to receive all elements of a class of binary matrices without obtaining redundant elements, e. g. without obtaining binary matrices that do not belong to the class. This makes it possible to avoid checking whether each of the objects received possesses...
Збережено в:
| Автор: | |
|---|---|
| Формат: | Книга |
| Опубліковано: |
Kherson State University,
2012-07-01T00:00:00Z.
|
| Предмети: | |
| Онлайн доступ: | Connect to this object online. |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
Інтернет
Connect to this object online.3rd Floor Main Library
| Шифр: |
A1234.567 |
|---|---|
| Примірник 1 | Доступно |