Просмотры | |
---|---|
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 | 94 |
Декабрь 2024 | Январь 2025 | Февраль 2025 | Март 2025 | Апрель 2025 | Май 2025 | Июнь 2025 | |
---|---|---|---|---|---|---|---|
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 | 0 | 1 | 4 | 1 | 1 | 11 | 1 |
Просмотры |
---|
Просмотры | |
---|---|
Россия | 55 |
Просмотры | |
---|---|
Kazan | 55 |