|
|
|
Publications in Math-Net.Ru |
Citations |
|
2025 |
| 1. |
A. F. Gainutdinova, “On the complexity of computing the “Shuffled Inequality” function in classical and quantum NOBDDs”, Izv. Vyssh. Uchebn. Zaved. Mat., 2025, no. 1, 3–14  ; Russian Math. (Iz. VUZ), 69:1 (2025), 1–10 |
1
|
|
2024 |
| 2. |
A. F. Gainutdinova, “Quantum and classical nondeterministic OBDDs”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 166:4 (2024), 470–484 |
1
|
|
2019 |
| 3. |
V. S. Kugurakov, A. F. Gainutdinova, V. T. Dubrovin, “About permutations on the sets of tuples from elements of the finite field”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 161:2 (2019), 292–300  |
|
2015 |
| 4. |
A. F. Gainutdinova, “Comparative complexity of quantum and classical OBDDs for total and partial functions”, Izv. Vyssh. Uchebn. Zaved. Mat., 2015, no. 11, 32–43 ; Russian Math. (Iz. VUZ), 59:11 (2015), 26–35  |
15
|
|
2014 |
| 5. |
A. F. Gainutdinova, “Complexity of branching programs for partial functions”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:3 (2014), 30–48 |
|
2009 |
| 6. |
A. F. Gainutdinova, “Quantum and Classical Simulation of Quantum Branching Programs”, Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009), 45–58 |
1
|
|
2006 |
| 7. |
A. F. Gainutdinova, “On simulating the quantum and classical branching programs”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:1 (2006), 45–64   ; J. Appl. Industr. Math., 1:1 (2007), 33–44 |
2
|
|
2002 |
| 8. |
A. F. Gainutdinova, “On the relative complexity of quantum and classical branching programs”, Diskr. Mat., 14:3 (2002), 109–121 ; Discrete Math. Appl., 12:5 (2002), 515–526 |
4
|
|
| Organisations |
|
|
