Počet záznamů: 1
On the proof complexity of the Nisan-Wigderson generator based on a hard NP boolean AND coNP function
SYS 0369662 LBL 01283^^^^^2200301^^^450 005 20240103200103.3 014 $a 000294810400002 $2 WOS 014 $a 80052754570 $2 SCOPUS 017 70
$a 10.1142/S0219061311000979 $2 DOI 100 $a 20120314d m y slo 03 ba 101 0-
$a eng $d eng 102 $a SG 200 1-
$a On the proof complexity of the Nisan-Wigderson generator based on a hard NP boolean AND coNP function 215 $a 17 s. 300 $a MSM0021620839 463 -1
$1 001 cav_un_epca*0327745 $1 011 $a 0219-0613 $e 1793-6691 $1 200 1 $a Journal of Mathematical Logic $v Roč. 11, č. 1 (2011), s. 11-27 $1 210 $c World Scientific Publishing 610 0-
$a proof complexity 610 0-
$a Nisan-Wigderson generator 700 -1
$3 cav_un_auth*0100670 $a Krajíček $b Jan $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $p MU-W $4 070 $T Matematický ústav AV ČR, v. v. i. 856 $u http://www.worldscinet.com/jml/11/1101/S0219061311000979.html
Počet záznamů: 1