Počet záznamů: 1
The provably total search problems of bounded arithmetic
SYS 0369680 LBL 02068^^^^^2200301^^^450 005 20240103200104.5 014 $a 000292311700004 $2 WOS 014 $a 79960135887 $2 SCOPUS 017 70
$a 10.1112/plms/pdq044 $2 DOI 100 $a 20120314d m y slo 03 ba 101 0-
$a eng $d eng 102 $a GB 200 1-
$a The provably total search problems of bounded arithmetic 215 $a 33 s. 463 -1
$1 001 cav_un_epca*0257499 $1 011 $a 0024-6115 $e 1460-244X $1 200 1 $a Proceedings of the London Mathematical Society $v Roč. 103, č. 1 (2011), s. 106-138 610 0-
$a Pigeonhole principle 610 0-
$a polynomial hierarchy 610 0-
$a local search 700 -1
$3 cav_un_auth*0231246 $a Skelley $b A. $y CA $4 070 701 -1
$3 cav_un_auth*0246710 $a Thapen $b Neil $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://plms.oxfordjournals.org/content/103/1/106
Počet záznamů: 1