| Views | |
|---|---|
| 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 | 114 |
| July 2025 | August 2025 | September 2025 | October 2025 | November 2025 | December 2025 | January 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 | 7 | 2 | 3 | 1 | 0 | 0 |
| Views | |
|---|---|
| 2019-262.pdf | 1 |
| Views | |
|---|---|
| Russia | 55 |
| Views | |
|---|---|
| Kazan | 55 |