Number of the records: 1
A New Characterization of ACC(0) and Probabilistic CC0
SYS 0352500 LBL 02043^^^^^2200313^^^450 005 20240103194432.3 014 $a 000278521500004 $2 WOS 014 $a 77953538534 $2 SCOPUS 017 $a 10.1007/s00037-010-0287-z $2 DOI 100 $a 20101221d m y slo 03 ba 101 0-
$a eng $d eng 102 $a CH 200 1-
$a A New Characterization of ACC(0) and Probabilistic CC0 215 $a 24 s. 463 -1
$1 001 cav_un_epca*0252542 $1 011 $a 1016-3328 $e 1420-8954 $1 200 1 $a Computational Complexity $v Roč. 19, č. 2 (2010), s. 211-234 $1 210 $c Springer 610 0-
$a bounded depth circuits 610 0-
$a counting circuits 610 0-
$a arithmetic circuits 610 0-
$a complexity classes 700 -1
$3 cav_un_auth*0224944 $a Hansen $b A. K. $y DK $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. 856 $u http://link.springer.com/article/10.1007%2Fs00037-010-0287-z
Number of the records: 1