Number of the records: 1  

The communication complexity of the inevitable intersection problem

  1. SYS0532192
    LBL
      
    01000a^^22220027750^450
    005
      
    20240103224416.6
    017
      
    $a 10.4086/cjtcs.2020.003 $2 DOI
    100
      
    $a 20200916d m y slo 03 ba
    101
      
    $a eng $d eng
    102
      
    $a US
    200
    1-
    $a The communication complexity of the inevitable intersection problem
    215
      
    $a 15 s.
    463
    -1
    $1 001 cav_un_epca*0252435 $1 011 $a 1073-0486 $1 200 1 $a Chicago Journal of Theoretical Computer Science $v Roč. 2020, April (2020) $1 210 $c MIT Press
    610
      
    $a communication complexity
    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 $z A $T Matematický ústav AV ČR, v. v. i.
    856
      
    $u https://doi.org/10.4086/cjtcs.2020.003 $9 RIV
Number of the records: 1  

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