| 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 | 101 |
| February 2025 | March 2025 | April 2025 | May 2025 | June 2025 | July 2025 | August 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 | 4 | 1 | 1 | 11 | 5 | 3 | 0 |
| Views |
|---|
| Views | |
|---|---|
| Russia | 55 |
| Views | |
|---|---|
| Kazan | 55 |