Počet záznamů: 1
Towards a reverse Newman’s theorem in interactive information complexity
SYS 0465743 LBL 01000a^^22220027750^450 005 20240103212958.5 014 $a 84954306921 $2 SCOPUS 014 $a 000384564100007 $2 WOS 017 $a 10.1007/s00453-015-0112-9 $2 DOI 100 $a 20161123d m y slo 03 ba 101 $a eng $d eng 102 $a US 200 1-
$a Towards a reverse Newman’s theorem in interactive information complexity 215 $a 33 s. 463 -1
$1 001 cav_un_epca*0250666 $1 011 $a 0178-4617 $e 1432-0541 $1 200 1 $a Algorithmica $v Roč. 76, č. 3 (2016), s. 749-781 $1 210 $c Springer 610 $a communication complexity 610 $a information complexity 610 $a information theory 700 -1
$3 cav_un_auth*0298676 $4 070 $a Brody $b J. $y DK 701 -1
$3 cav_un_auth*0216829 $4 070 $a Buhrman $b H. $y NL 701 -1
$3 cav_un_auth*0215097 $4 070 $a Koucký $b Michal $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 CZ $T Matematický ústav AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0298677 $4 070 $a Loff $b B. $y NL 701 -1
$3 cav_un_auth*0298678 $4 070 $a Speelman $b F. $y NL 701 -1
$3 cav_un_auth*0232729 $4 070 $a Vereshchagin $b N.K. $y RU 856 $u http://link.springer.com/article/10.1007%2Fs00453-015-0112-9
Počet záznamů: 1