Počet záznamů: 1
A note on propositional proof complexity of some Ramsey-type statements
SYS 0369652 LBL 01986^^^^^2200313^^^450 005 20240103200102.4 014 $a 000286668400014 $2 WOS 014 $a 79251623828 $2 SCOPUS 017 $a 10.1007/s00153-010-0212-9 $2 DOI 100 $a 20111220d m y slo 03 ba 101 0-
$a eng $d eng 102 $a DE 200 1-
$a A note on propositional proof complexity of some Ramsey-type statements 215 $a 11 s. 300 $a MSM0021620839 463 -1
$1 001 cav_un_epca*0256186 $1 011 $a 0933-5846 $e 1432-0665 $1 200 1 $a Archive for Mathematical Logic $v Roč. 50, 1-2 (2011), s. 245-255 $1 210 $c Springer 610 0-
$a proof complexity 610 0-
$a Ramsey theorem 610 0-
$a resolution 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.springerlink.com/content/q27255801x225772/
Počet záznamů: 1