Počet záznamů: 1
On extracting computations from propositional proofs
SYS 0422140 LBL 02416^^^^^2200361^^^450 005 20240103203547.1 014 $a 000310361000003 $2 WOS 014 $a 84880199880 $2 SCOPUS 017 70
$a 10.4230/LIPIcs.FSTTCS.2010.30 $2 DOI 100 $a 20140117d m y slo 03 ba 101 0-
$a eng $d eng 102 $a DE 200 1-
$a On extracting computations from propositional proofs 215 $a 12 s. $c P 463 -1
$1 001 cav_un_epca*0422139 $1 010 $a 978-3-939897-23-1 $1 200 1 $a IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science $v S. 30-41 $1 205 $a 1. $1 210 $a Wadem $c Schloss Dagstuhl, Leibniz-Zentrum für Informatik $d 2010 $1 225 $a Leibniz International Proceedings in Informatics $v vol. 8 $1 702 1 $a Lodaya $b K. $4 340 $1 702 1 $a Mahajan $b M $4 340 610 0-
$a proof complexity 610 0-
$a propositional tautology 610 0-
$a boolean circuits 700 -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. 856 $u http://drops.dagstuhl.de/opus/volltexte/2010/2851/
Počet záznamů: 1