Number of the records: 1
A Lower Bound on CNF Encodings of the At-most-one Constraint
SYS 0494392 LBL 01000a^^22220027750^450 005 20240103220625.5 014 $a 85053701165 $2 SCOPUS 014 $a 000459528200005 $2 WOS 017 $a 10.1016/j.tcs.2018.09.003 $2 DOI 100 $a 20181011d m y slo 03 ba 101 $a eng 102 $a NL 200 1-
$a A Lower Bound on CNF Encodings of the At-most-one Constraint 215 $a 23 s. 463 -1
$1 001 cav_un_epca*0257658 $1 011 $a 0304-3975 $e 1879-2294 $1 200 1 $a Theoretical Computer Science $v Roč. 762, March (2019), s. 51-73 $1 210 $c Elsevier 610 $a Knowledge compilation 610 $a Cardinality constraint 610 $a At most one constraint 610 $a Propagation complete encoding 700 -1
$3 cav_un_auth*0016026 $a Kučera $b P. $y CZ $z K 701 -1
$3 cav_un_auth*0100825 $a Savický $b Petr $p UIVT-O $i Oddělení teoretické informatiky $j Department of Theoretical Computer Science $w Department of Theoretical Computer Science $z K $T Ústav informatiky AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0350253 $a Vorel $b V. $y CZ $z K 856 $9 RIV $u http://dx.doi.org/10.1016/j.tcs.2018.09.003
Number of the records: 1