Počet záznamů: 1
A composition theorem for randomized query complexity
SYS 0487435 LBL 01000a^^22220027750^450 005 20240103215718.3 014 $a 85043986619 $2 SCOPUS 017 $a 10.4230/LIPIcs.FSTTCS.2017.10 $2 DOI 100 $a 20180305d m y slo 03 ba 101 $a eng $d eng 102 $a DE 200 1-
$a A composition theorem for randomized query complexity 215 $a 13 s. $c E 463 -1
$1 001 cav_un_epca*0487436 $1 010 $a 978-3-95977-055-2 $1 011 $a 1868-8969 $1 200 1 $a 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017) $v S. 1-13 $1 210 $a Dagstuhl $c Schloss Dagstuhl, Leibniz-Zentrum für Informatik $d 2018 $1 225 $a Leibniz International Proceedings in Informatics $i 93 $1 702 1 $a Lokam $b S. $4 340 $1 702 1 $4 340 $a Ramanujam $b R. 610 $a query algorithms and complexity 610 $a decision trees 610 $a composition theorem 700 -1
$3 cav_un_auth*0358852 $4 070 $a Anshu $b A. $y SG 701 -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*0358853 $4 070 $a Jain $b R. $y SG 701 -1
$3 cav_un_auth*0358854 $4 070 $a Kundu $b S. $y SG 701 -1
$3 cav_un_auth*0358855 $4 070 $a Lee $b T. $y SG 701 -1
$3 cav_un_auth*0358856 $4 070 $a Mukhopadhyay $b P. $y SG 701 -1
$3 cav_un_auth*0358857 $4 070 $a Santha $b M. $y SG 701 -1
$3 cav_un_auth*0358858 $4 070 $a Sanyal $b S. $y SG 856 $u http://drops.dagstuhl.de/opus/volltexte/2018/8396/
Počet záznamů: 1