Počet záznamů: 1
A composition theorem for randomized query complexity via Max-conflict complexity
SYS 0507748 LBL 01000a^^22220027750^450 005 20240103222434.5 014 $a 85069200872 $2 SCOPUS 017 $a 10.4230/LIPIcs.ICALP.2019.64 $2 DOI 100 $a 20190822d m y slo 03 ba 101 $a eng $d eng 102 $a DE 200 1-
$a A composition theorem for randomized query complexity via Max-conflict complexity 215 $a 13 s. $c P 463 -1
$1 001 cav_un_epca*0507747 $1 010 $a 978-3-95977-109-2 $1 011 $a 1868-8969 $1 200 1 $a 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) $1 210 $a Dagstuhl $c Schloss Dagstuhl, Leibniz-Zentrum für Informatik $d 2019 $1 225 $a Leibniz International Proceedings in Informatics (LIPIcs) $v 132 $1 702 1 $a Baier $b Ch. $4 340 $1 702 1 $4 340 $a Chatzigiannakis $b I. $1 702 1 $4 340 $a Flocchini $b P. $1 702 1 $4 340 $a Leonardi $b S. 610 $a query complexity 610 $a lower bounds 700 -1
$3 cav_un_auth*0298540 $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 Gavinsky $b Dmitry $p MU-W $y IL $T Matematický ústav AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0378898 $4 070 $a Lee $b T. $y AU 701 -1
$3 cav_un_auth*0358857 $4 070 $a Santha $b M. $y SG 701 -1
$3 cav_un_auth*0378899 $4 070 $a Sanyal $b S. $y IN 856 $u http://drops.dagstuhl.de/opus/volltexte/2019/10640/
Počet záznamů: 1