Počet záznamů: 1
Feasible set functions have small circuits
SYS 0499289 LBL 01000a^^22220027750^450 005 20240103221257.1 014 $a 85058974478 $2 SCOPUS 014 $a 000472084400004 $2 WOS 017 $a 10.3233/COM-180096 $2 DOI 100 $a 20190107d m y slo 03 ba 101 $a eng $d eng 102 $a NL 200 1-
$a Feasible set functions have small circuits 215 $a 32 s. 463 -1
$1 001 cav_un_epca*0499290 $1 011 $a 2211-3568 $1 200 1 $a Computability $v Roč. 8, č. 1 (2019), s. 67-98 $1 210 $c IOS Press 610 $a computational complexity 610 $a primitive recursive set functions 610 $a circuit complexity 610 $a Cobham recursive set functions 700 -1
$3 cav_un_auth*0298542 $4 070 $a Beckmann $b A. $y GB $z K 701 -1
$3 cav_un_auth*0079821 $4 070 $a Buss $b S. $y US 701 -1
$3 cav_un_auth*0327819 $4 070 $a Friedman $b S.-D. $y AT 701 -1
$3 cav_un_auth*0327820 $4 070 $a Müller $b M. $y AT 701 -1
$3 cav_un_auth*0246710 $4 070 $a Thapen $b Neil $p MU-W $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $w Mathematical Logic and Theoretical Computer Science $y CZ $T Matematický ústav AV ČR, v. v. i. 856 $9 RIV $u http://dx.doi.org/10.3233/COM-180096
Počet záznamů: 1