| Просмотры | |
|---|---|
| Complexity and algorithms for obtaining representations of multiple-output boolean functions in polynomial forms and in reversible logic circuits: a thesis abstract submitted for the degree of candidate of sciences (Physics and Mathematics)(translated from Russian): 01.01.09 — discrete math and mathematical cybernetics | 126 |
| Октябрь 2025 | Ноябрь 2025 | Декабрь 2025 | Январь 2026 | Февраль 2026 | Март 2026 | Апрель 2026 | |
|---|---|---|---|---|---|---|---|
| Complexity and algorithms for obtaining representations of multiple-output boolean functions in polynomial forms and in reversible logic circuits: a thesis abstract submitted for the degree of candidate of sciences (Physics and Mathematics)(translated from Russian): 01.01.09 — discrete math and mathematical cybernetics | 3 | 1 | 0 | 2 | 1 | 7 | 2 |
| Просмотры | |
|---|---|
| 2019-262.pdf | 1 |
| Просмотры | |
|---|---|
| Россия | 55 |
| Просмотры | |
|---|---|
| Kazan | 55 |