Number of the records: 1  

Bare quantum simultaneity versus classical interactivity in communication complexity

  1. SYS0525399
    LBL
      
    01000a^^22220027750^450
    005
      
    20240103224217.2
    014
      
    $a 85086768381 $2 SCOPUS
    014
      
    $a 000614624700032 $2 WOS
    017
      
    $a 10.1145/3357713.3384243 $2 DOI
    100
      
    $a 20200703d m y slo 03 ba
    101
      
    $a eng $d eng
    102
      
    $a US
    200
    1-
    $a Bare quantum simultaneity versus classical interactivity in communication complexity
    215
      
    $a 11 s. $c P
    463
    -1
    $1 001 cav_un_epca*0525400 $1 010 $a 978-1-4503-6979-4 $1 200 1 $a STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing $v S. 401-411 $1 205 $a 1. $1 210 $a New York $c Association for Computing Machinery $d 2020 $1 702 1 $a Makarychev $b K. $4 340 $1 702 1 $4 340 $a Makarychev $b Y. $1 702 1 $4 340 $a Tulsiani $b M. $1 702 1 $4 340 $a Kamath $b G. $1 702 1 $4 340 $a Chuzhoy $b J.
    610
      
    $a quantum communication complexity
    610
      
    $a communication complexity models
    700
    -1
    $3 cav_un_auth*0298540 $a Gavinsky $b Dmitry $p MU-W $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $w Mathematical Logic and Theoretical Computer Science $y IL $4 070 $T Matematický ústav AV ČR, v. v. i.
    856
      
    $u https://doi.org/10.1145/3357713.3384243
Number of the records: 1  

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