Number of the records: 1
Amplifying lower bounds by means of self-reducibility
SYS 0352511 LBL 01894^^^^^2200301^^^450 005 20240103194433.2 014 $a 000277058400003 $2 WOS 014 $a 77950344196 $2 SCOPUS 017 $a 10.1145/1706591.1706594 $2 DOI 100 $a 20101221d m y slo 03 ba 101 0-
$a eng $d eng 102 $a US 200 1-
$a Amplifying lower bounds by means of self-reducibility 215 $a 36 s. 463 -1
$1 001 cav_un_epca*0253514 $1 011 $a 0004-5411 $e 1557-735X $1 200 1 $a Journal of the ACM $v Roč. 57, č. 3 (2010), s. 1-36 $1 210 $c Association for Computing Machinery 610 0-
$a Circuit Complexity 610 0-
$a Lower Bounds 610 0-
$a Natural Proofs 610 0-
$a Self-Reducibility 610 0-
$a Time-Space Tradeoffs 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. 856 $u http://dl.acm.org/citation.cfm?doid=1706591.1706594
Number of the records: 1