Počet záznamů: 1
Complexity of Propositional Proofs Under a Promise
SYS 0343940 LBL 01611^^^^^2200301^^^450 005 20240103193614.4 014 $a 000277925300004 $2 WOS 014 $a 77952800429 $2 SCOPUS 017 $a 10.1145/1740582.1740586 $2 DOI 100 $a 20100616d m y slo 03 ba 101 0-
$a eng $d eng 102 $a US 200 1-
$a Complexity of Propositional Proofs Under a Promise 215 $a 29 s. 463 -1
$1 001 cav_un_epca*0043486 $1 011 $a 1529-3785 $e 1557-945X $1 200 1 $a ACM Transactions on Computational Logic $v Roč. 11, č. 3 (2010), s. 1-29 $1 210 $c Association for Computing Machinery 610 0-
$a theory 610 0-
$a promise problems 610 0-
$a propositional proof complexity 610 0-
$a random 3CNF 610 0-
$a resolution 700 -1
$3 cav_un_auth*0262286 $a Dershowitz $b N. $y IL $4 070 701 -1
$3 cav_un_auth*0262287 $a Tzameret $b Iddo $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://dl.acm.org/citation.cfm?doid=1740582.1740586
Počet záznamů: 1