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 F. Ablayev, A. Khasianov, A. Vasiliev, On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions, // Electronic Colloquium on Computational Complexity, TR08-085, (2008), p. 10.
    Annotation Electronic Colloquium on Computational Complexity
    Keywords quantum computing, branching programs, complexity theory, computer science
    The name of the journal Electronic Colloquium on Computational Complexity
    URL http://eccc.hpi-web.de/eccc-reports/2008/TR08-085/index.html
    Please use this ID to quote from or refer to the card https://repository.kpfu.ru/eng/?p_id=11126&p_lang=2

    Full metadata record