 | 2007 |
|---|
| 6 |       | Farid M. Ablayev,
Aida Gainutdinova:
Classical Simulation Complexity of Quantum Branching Programs.
LATA 2007: 49-56 |
| 2005 |
|---|
| 5 |  | Farid M. Ablayev,
Aida Gainutdinova:
Complexity of Quantum Uniform and Nonuniform Automata.
Developments in Language Theory 2005: 78-87 |
| 4 | | Farid M. Ablayev,
Aida Gainutdinova,
Marek Karpinski,
Cristopher Moore,
Chris Pollett:
On the computational power of probabilistic and quantum branching program.
Inf. Comput. 203(2): 145-162 (2005) |
| 2003 |
|---|
| 3 | | Farid M. Ablayev,
Aida Gainutdinova:
Classical Simulation Complexity of Quantum Machines.
FCT 2003: 296-302 |
| 2001 |
|---|
| 2 | | Farid M. Ablayev,
Aida Gainutdinova,
Marek Karpinski:
On Computational Power of Quantum Branching Programs.
FCT 2001: 59-70 |
| 2000 |
|---|
| 1 | | Farid M. Ablayev,
Aida Gainutdinova:
On the Lower Bounds for One-Way Quantum Automata.
MFCS 2000: 132-140 |
Data released under the ODC-BY 1.0 license — See also our legal information page