Languages with Bounded Multiparty Communication Complexity
SYS 0084614 LBL 02707^^^^^2200349^^^450 005 20240103184327.9 100 $a 20080111d m y slo 03 ba 101 0-
$a eng $d eng $d cze 102 $a DE 200 1-
$a Languages with Bounded Multiparty Communication Complexity 215 $a 11 s. 300 $a project No. 1M0021620808 463 -1
$1 001 cav_un_epca*0084613 $1 010 $a 978-3-540-70917-6 $1 200 1 $a Proceeding of the 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2007 $v S. 500-511 $1 210 $a Berlin $c Springer-Verlag $d 2007 $1 225 $a Lecture Notes in Computer Science $i 4393 $1 702 1 $a Thomas $b W. $4 340 $1 702 1 $a Weil $b P. $4 340 541 1-
$a Jazyky s omezenou komunikační složitostí pro více hráčů $z cze 610 0-
$a communication complexity 610 0-
$a codes 610 0-
$a Ramsey theory 700 -1
$3 cav_un_auth*0217301 $a Chattopadhyay $b A. $y CA $x X $4 070 701 -1
$3 cav_un_auth*0215097 $a Koucký $b Michal $p MU-W $w Mathematical Logic and Theoretical Computer Science $4 070 $T Matematický ústav AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0229300 $a Krebs $b A. $y DE $x X $4 070 701 -1
$3 cav_un_auth*0217303 $a Szegedy $b M. $y US $x X $4 070 701 -1
$3 cav_un_auth*0217304 $a Tesson $b P. $y CA $x X $4 070 701 -1
$3 cav_un_auth*0216844 $a Thérien $b D. $y CA $x X $4 070