Airat Khasianov

	2010
3		Airat Khasianov: Stronger Lower Bounds on Quantum OBDD for the Hidden Subgroup Problem. Electronic Colloquium on Computational Complexity (ECCC) 17: 30 (2010)
	2008
2		Farid M. Ablayev, Airat Khasianov, Alexander Vasiliev: On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions. Electronic Colloquium on Computational Complexity (ECCC) 15(085): (2008)
	2005
1		Airat Khasianov: Complexity bounds on some fundamental computational problems for quantum branching programs. University of Bonn 2005: 1-172

Coauthor Index

1	Farid M. Ablayev	[2]
2	Alexander Vasiliev	[2]

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page