Number of the records: 1
Random resolution refutations
SYS 0477098 LBL 01000a^^22220027750^450 005 20240103214404.7 014 $a 85028743827 $2 SCOPUS 017 $a 10.4230/LIPIcs.CCC.2017.1 $2 DOI 100 $a 20170714d m y slo 03 ba 101 $a eng $d eng 102 $a DE 200 1-
$a Random resolution refutations 215 $a 10 s. $c E 463 -1
$1 001 cav_un_epca*0477100 $1 010 $a 978-3-95977-040-8 $1 011 $a 1868-8969 $1 200 1 $a 32nd Computational Complexity Conference (CCC 2017) $v S. 1-10 $1 205 $a 1. $1 210 $a Dagstuhl $c Schloss Dagstuhl, Leibniz-Zentrum für Informatik $d 2017 $1 225 $a Leibniz International Proceedings in Informatics $v 79 $1 702 1 $a O’Donnell $b R. $4 340 610 $a proof complexity 610 $a random 610 $a resolution 610 $a resolution 700 -1
$3 cav_un_auth*0100699 $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $w Mathematical Logic and Theoretical Computer Science $4 070 $a Pudlák $b Pavel $p MU-W $y CZ $T Matematický ústav AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0246710 $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $w Mathematical Logic and Theoretical Computer Science $4 070 $a Thapen $b Neil $p MU-W $y CZ $T Matematický ústav AV ČR, v. v. i. 856 $u http://drops.dagstuhl.de/opus/volltexte/2017/7523
Number of the records: 1