Gainutdinova Aida Faritovna

Publications in Math-Net.Ru

1. On the complexity of computing the “Shuffled Inequality” function in classical and quantum NOBDDs
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 2025, no. 1,  3–14
2. Quantum and classical nondeterministic OBDDs
   
   Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 166:4 (2024),  470–484
3. 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
4. Comparative complexity of quantum and classical OBDDs for total and partial functions
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 2015, no. 11,  32–43
5. Complexity of branching programs for partial functions
   
   Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:3 (2014),  30–48
6. Quantum and Classical Simulation of Quantum Branching Programs
   
   Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009),  45–58
7. On simulating the quantum and classical branching programs
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 13:1 (2006),  45–64
8. On the relative complexity of quantum and classical branching programs
   
   Diskr. Mat., 14:3 (2002),  109–121