Počet záznamů: 1
Derandomizing from random strings
SYS 0352483 LBL 02023^^^^^2200325^^^450 005 20240103194431.3 014 $a 000286932700007 $2 WOS 014 $a 77955259331 $2 SCOPUS 017 70
$a 10.1109/CCC.2010.15 100 $a 20101221d m y slo 03 ba 101 0-
$a eng $d eng 102 $a US 200 1-
$a Derandomizing from random strings 215 $a 6 s. 463 -1
$1 001 cav_un_epca*0352482 $1 010 $a 978-0-7695-4060-3 $1 200 1 $a Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010 $v S. 58-63 $1 210 $a Los Alamitos $c IEEE Computer Society 2010 $d 2010 610 0-
$a Kolmogorov random strings 610 0-
$a reducibility 610 0-
$a complexity classes 700 -1
$3 cav_un_auth*0216829 $a Buhrman $b H. $y NL $4 070 701 -1
$3 cav_un_auth*0232727 $a Fortnow $b L. $y US $4 070 701 -1
$3 cav_un_auth*0215097 $a Koucký $b Michal $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $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*0267382 $a Loff $b B. $y PT $4 070 856 $u http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5497897
Počet záznamů: 1