| 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 | 75 |
| June 2024 | July 2024 | August 2024 | September 2024 | October 2024 | November 2024 | December 2024 | |
|---|---|---|---|---|---|---|---|
| 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 | 2 | 0 | 0 | 0 | 0 | 0 | 0 |
| Views |
|---|
| Views | |
|---|---|
| Russia | 55 |
| Views | |
|---|---|
| Kazan | 55 |