Počet záznamů: 1
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
SYS 0352607 LBL 02183^^^^^2200337^^^450 005 20240103194439.5 014 $a 000284450000003 $2 WOS 014 $a 78349310875 $2 SCOPUS 017 $a 10.1016/j.jcss.2010.06.004 $2 DOI 100 $a 20101222d m y slo 03 ba 101 0-
$a eng $d eng 102 $a US 200 1-
$a The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory 215 $a 27 s. 463 -1
$1 001 cav_un_epca*0253682 $1 011 $a 0022-0000 $e 1090-2724 $1 200 1 $a Journal of Computer and System Sciences $v Roč. 77, č. 1 (2011), s. 14-40 $1 210 $c Elsevier 610 0-
$a Circuit complexity 610 0-
$a Distinguishing complexity 610 0-
$a FewEXP 610 0-
$a Formula size 610 0-
$a Kolmogorov complexity 700 -1
$3 cav_un_auth*0215095 $a Allender $b E. $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*0215105 $a Ronneburger $b D. $y US $4 070 701 -1
$3 cav_un_auth*0267450 $a Roy $b S. $y IN $4 070 856 $u http://www.sciencedirect.com/science/article/pii/S0022000010000887
Počet záznamů: 1