| 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 | 161 |
| April 2026 | May 2026 | June 2026 | July 2026 | August 2026 | September 2026 | October 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 |
| Views | |
|---|---|
| 2019-262.pdf | 3 |
| Views | |
|---|---|
| Russia | 55 |
| Views | |
|---|---|
| Kazan | 55 |