Počet záznamů: 1
A Lower Bound on CNF Encodings of the At-Most-One Constraint
SYS 0478486 LBL 01000a^^22220027750^450 005 20240103214544.7 014 $a 85028698187 $2 SCOPUS 014 $a 000455337600026 $2 WOS 017 $a 10.1007/978-3-319-66263-3_26 $2 DOI 100 $a 20170926d m y slo 03 ba 101 $a eng 102 $a CH 200 1-
$a A Lower Bound on CNF Encodings of the At-Most-One Constraint 215 $a 17 s. $c P 463 -1
$1 001 cav_un_epca*0478485 $1 010 $a 978-3-319-66262-6 $1 011 $a 0302-9743 $1 200 1 $a Theory and Applications of Satisfiability Testing - SAT 2017 $v S. 412-428 $1 210 $a Cham $c Springer $d 2017 $1 225 $a Lecture Notes in Computer Science $v 10491 $1 702 1 $4 340 $a Gaspers $b S. $1 702 1 $4 340 $a Walsh $b T. 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 $i Oddělení teoretické informatiky $j Department of Theoretical Computer Science $p UIVT-O $w Department of Theoretical Computer Science $T Ústav informatiky AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0350253 $a Vorel $b V. $y CZ
Počet záznamů: 1