Number of the records: 1
The space complexity of cutting planes refutations
SYS 0448832 LBL 02005^^^^^2200361^^^450 005 20240103210911.4 014 $a 84958236932 $2 SCOPUS 017 70
$a 10.4230/LIPIcs.CCC.2015.433 $2 DOI 100 $a 20151020d m y slo 03 ba 101 0-
$a eng $d eng 102 $a DE 200 1-
$a The space complexity of cutting planes refutations 215 $a 15 s. $c P 463 -1
$1 001 cav_un_epca*0448833 $1 010 $a 978-3-939897-81-1 $1 011 $a 1868-8969 $1 200 1 $a 30th Conference on Computational Complexity (CCC 2015) $v S. 433-447 $1 210 $a Dagstuhl $c Schloss Dagstuhl, Leibniz-Zentrum für Informatik $d 2015 $1 225 $a Leibniz International Proceedings in Informatics $v 33 $1 702 1 $a Zuckerman $b D. $4 340 610 0-
$a proof complexity 610 0-
$a space 610 0-
$a cutting planes 700 -1
$3 cav_un_auth*0312064 $a Galesi $b N. $y IT $4 070 701 -1
$3 cav_un_auth*0100699 $a Pudlák $b Pavel $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*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://drops.dagstuhl.de/opus/volltexte/2015/5055/
Number of the records: 1