| Просмотры | |
|---|---|
| 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 | 161 |
| Апрель 2026 | Май 2026 | Июнь 2026 | Июль 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 | 8 | 2 | 1 | 6 | 10 | 10 | 0 |
| Просмотры | |
|---|---|
| 2019-262.pdf | 3 |
| Просмотры | |
|---|---|
| Россия | 55 |
| Просмотры | |
|---|---|
| Kazan | 55 |