Počet záznamů: 1
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
SYS 0352519 LBL 02072^^^^^2200325^^^450 005 20240103194433.8 014 $a 000272912800009 $2 WOS 014 $a 72249101979 $2 SCOPUS 017 $a 10.1007/s00224-008-9160-8 $2 DOI 100 $a 20101221d m y slo 03 ba 101 0-
$a eng $d eng 102 $a US 200 1-
$a Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible? 215 $a 14 s. 463 -1
$1 001 cav_un_epca*0255220 $1 011 $a 1432-4350 $e 1433-0490 $1 200 1 $a Theory of Computing Systems $v Roč. 46, č. 1 (2010), s. 143-156 $1 210 $c Springer 610 0-
$a one-way functions 610 0-
$a polynomial hierarchy 610 0-
$a Kolmogorov generic oracles 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*0232728 $a Rogers $b J.D. $y US $4 070 701 -1
$3 cav_un_auth*0232729 $a Vereshchagin $b N.K. $y RU $4 070 856 $u http://link.springer.com/article/10.1007%2Fs00224-008-9160-8
Počet záznamů: 1