フォロー
Aida Gainutdinova
Aida Gainutdinova
確認したメール アドレス: kpfu.ru
タイトル
引用先
引用先
On computational power of quantum branching programs
F Ablayev, A Gainutdinova, M Karpinski
International Symposium on Fundamentals of Computation Theory, 59-70, 2001
702001
On computational power of quantum branching programs
F Ablayev, A Gainutdinova, M Karpinski
International Symposium on Fundamentals of Computation Theory, 59-70, 2001
702001
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
552005
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
552005
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
F Ablayev, A Gainutdinova, K Khadiev, A Yakaryılmaz
International Workshop on Descriptional Complexity of Formal Systems, 53-64, 2014
442014
On the lower bounds for one-way quantum automata
F Ablayev, A Gainutdinova
International Symposium on Mathematical Foundations of Computer Science, 132-140, 2000
372000
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
F Ablayev, A Gainutdinova, K Khadiev, A Yakaryılmaz
Lobachevskii Journal of Mathematics 37 (6), 670-682, 2016
332016
Complexity of quantum uniform and nonuniform automata
F Ablayev, A Gainutdinova
International Conference on Developments in Language Theory, 78-87, 2005
212005
Comparative complexity of quantum and classical OBDDs for total and partial functions
AF Gainutdinova
Russian Mathematics 59 (11), 26-35, 2015
202015
Unary probabilistic and quantum automata on promise problems
A Gainutdinova, A Yakaryılmaz
International Conference on Developments in Language Theory, 252-263, 2015
182015
Unary probabilistic and quantum automata on promise problems
A Gainutdinova, A Yakaryılmaz
Quantum Information Processing 17 (2), 1-17, 2018
132018
Nondeterministic unitary OBDDs
A Gainutdinova, A Yakaryılmaz
International Computer Science Symposium in Russia, 126-140, 2017
122017
Classical simulation complexity of quantum machines
F Ablayev, A Gainutdinova
International Symposium on Fundamentals of Computation Theory, 296-302, 2003
52003
О сравнительной сложности квантовых и классических бинарных программ
АФ Гайнутдинова
Дискретная математика 14 (3), 109-121, 2002
52002
Квантовые вычисления
АФ Гайнутдинова
метод. пособие. АФ Гайнутдинова.–Казань: Казанский государственный …, 2009
32009
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 (6), 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 (7), 1024-1038, 2018
12018
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20