Kazan (Volga region) Federal University, KFU
KAZAN
FEDERAL UNIVERSITY
 
ON COMPLEXITY OF QUANTUM BRANCHING PROGRAMS COMPUTING EQUALITY-LIKE BOOLEAN FUNCTIONS
Form of presentationArticles in international journals and collections
Year of publication2008
Языканглийский
  • Ablaev Farid Mansurovich, author
  • Vasilev Aleksandr Valerevich, author
  • Khasyanov Ayrat Faridovich, author
  • Bibliographic description in the original language Farid Ablayev, On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions / Farid Ablayev, Airat Khasianov, Alexander Vasilyev // Electronic Colloquium on Computational Complexity, TR08-085, (2008)
    Annotation Electronic Colloquium on Computational Complexity
    Keywords Branching programs, complexity theory, computer science, quantum computing
    The name of the journal Electronic Colloquium on Computational Complexity,
    Please use this ID to quote from or refer to the card https://repository.kpfu.ru/eng/?p_id=154658&p_lang=2

    Full metadata record