Number of the records: 1
Towards a reverse Newman's theorem in interactive information complexity
SYS 0422288 LBL 02784^^^^^2200457^^^450 005 20240103203557.1 014 $a 84885615207 $2 SCOPUS 014 $a 000332541200004 $2 WOS 017 70
$a 10.1109/CCC.2013.12 $2 DOI 100 $a 20140226d m y slo 03 ba 101 0-
$a eng $d eng 102 $a US 200 1-
$a Towards a reverse Newman's theorem in interactive information complexity 215 $a 10 s. $c P 463 -1
$1 001 cav_un_epca*0422287 $1 010 $a 978-1-4673-6466-9 $1 200 1 $a IEEE Conference on Computational Complexity 2013 $v S. 24-33 $1 205 $a 1. $1 210 $a Washington $c IEEE $d 2013 610 0-
$a comlexity theory 610 0-
$a communication complexity 610 0-
$a interactive information complexity 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 $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $w Mathematical Logic and Theoretical Computer Science $4 070 $a Koucký $b Michal $p MU-W $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://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6597746
Number of the records: 1