Подписаться
Aida Gainutdinova
Aida Gainutdinova
Подтвержден адрес электронной почты в домене kpfu.ru
Название
Процитировано
Процитировано
Год
On computational power of quantum branching programs
F Ablayev, A Gainutdinova, M Karpinski
Fundamentals of Computation Theory: 13th International Symposium, FCT 2001 …, 2001
802001
On the computational power of probabilistic and quantum branching program
F Ablayev, A Gainutdinova, M Karpinski, C Moore, C Pollett
Information and Computation 203 (2), 145-162, 2005
662005
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
F Ablayev, A Gainutdinova, K Khadiev, A Yakaryılmaz
Descriptional Complexity of Formal Systems: 16th International Workshop …, 2014
462014
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
F Ablayev, A Gainutdinova, K Khadiev, A Yakaryılmaz
Lobachevskii Journal of Mathematics 37, 670-682, 2016
422016
On the lower bounds for one-way quantum automata
F Ablayev, A Gainutdinova
International Symposium on Mathematical Foundations of Computer Science, 132-140, 2000
422000
Complexity of quantum uniform and nonuniform automata
F Ablayev, A Gainutdinova
Developments in Language Theory: 9th International Conference, DLT 2005 …, 2005
252005
Comparative complexity of quantum and classical OBDDs for total and partial functions
AF Gainutdinova
Russian Mathematics 59, 26-35, 2015
222015
Unary probabilistic and quantum automata on promise problems
A Gainutdinova, A Yakaryılmaz
International Conference on Developments in Language Theory, 252-263, 2015
172015
Unary probabilistic and quantum automata on promise problems
A Gainutdinova, A Yakaryılmaz
Quantum Information Processing 17, 1-17, 2018
162018
Nondeterministic unitary OBDDs
A Gainutdinova, A Yakaryılmaz
Computer Science–Theory and Applications: 12th International Computer …, 2017
132017
Classical simulation complexity of quantum machines
F Ablayev, A Gainutdinova
Fundamentals of Computation Theory: 14th International Symposium, FCT 2003 …, 2003
62003
Квантовые вычисления
АФ Гайнутдинова
метод. пособие. АФ Гайнутдинова.–Казань: Казанский государственный …, 2009
52009
О сравнительной сложности квантовых и классических бинарных программ
АФ Гайнутдинова
Дискретная математика 14 (3), 109-121, 2002
52002
On relative complexity of quantum and classical branching programs
AF Gainutdinova
Discrete Mathematics and Applications 12 (5), 515-526, 2002
32002
On the full monomial automorphism groups of Reed–Solomon codes and their MDS-extensions
V Kugurakov, A Gainutdinova
Lobachevskii Journal of Mathematics 37, 650-669, 2016
22016
О моделировании квантовых и классических бинарных программ
АФ Гайнутдинова
Дискретный анализ и исследование операций 13 (1), 45-64, 2006
22006
On classical stimulation of quantum machines
F Ablayev, A Gainutdinova
Quantum Informatics 2004 5833, 109-115, 2005
22005
On calculation of monomial automorphisms of linear cyclic codes
VS Kugurakov, A Gainutdinova, T Anisimova
Lobachevskii Journal of Mathematics 39, 1024-1038, 2018
12018
The features of the language of representation of humour in the texts of American and Russian stand-up comedians
EV Martynova, LR Sakaeva, DF Khakimzyanova, IB Bashirova, ...
Journal of Fundamental and Applied Sciences 9 (7S), 1204-1211, 2017
12017
Functioning of the reflexive pronouns in the contemporary Russian language
T Troshkina, A Gainutdinova
Asian Social Science 11 (1), 22, 2015
12015
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20