Number of the records: 1  

Exact Quantum Query Complexity of EXACTk,l(n)

  1. TitleExact Quantum Query Complexity of EXACTk,l(n)
    Author Ambainis A. Nagaj Daniel 1980 SAVFYZIK - Fyzikálny ústav SAV    SCOPUS    RID    ORCID

    Co-authors Iradis J.
    Source document Lecture Notes in Computer Science. Vol. 10329 (2017), p. 243-255. - Heidelberg : Springer
    Languageeng - English
    Document kindrozpis článkov z periodík (rzb)
    CitationsQIU, Daowen - XU, Guoliang. Exact Quantum 1-Query Algorithms and Complexity. In SPIN. ISSN 2010-3247, 2021, vol. 11, no. 03, 2140001. Dostupné na: https://doi.org/10.1142/S2010324721400014.
    YE, Ze-Kun - LI, Lv-Zhou. Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions. In JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2023, vol. 38, no. 6, pp. 1423-1430. ISSN 1000-9000. Dostupné na: https://doi.org/10.1007/s11390-022-1361-0.
    CategoryADMB - Scientific papers in foreign non-impacted journals registered in Web of Sciences or Scopus
    Category of document (from 2022)V3 - Vedecký výstup publikačnej činnosti z časopisu
    Type of documentčlánok
    Year2017
    Registered inWOS
    Registered inSCOPUS
    DOI 10.1007/978-3-319-51963-0_19
    article

    article

    rokCCIFIF Q (best)JCR Av Jour IF PercSJRSJR Q (best)CiteScore
    N
    rok vydaniarok metrikyIFIF Q (best)SJRSJR Q (best)
    201720160.339Q2
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.