Počet záznamů: 1
A separator theorem for hypergraphs and a CSP-SAT algorithm
SYS 0551098 LBL 01000a^^22220027750^450 005 20231122150241.4 014 $a 85123311375 $2 SCOPUS 014 $a 000744066500008 $2 WOS 017 $a 10.46298/lmcs-17(4:17)2021 $2 DOI 100 $a 20220107d m y slo 03 ba 101 $a eng $d eng 102 $a DE 200 1-
$a A separator theorem for hypergraphs and a CSP-SAT algorithm 215 $a 14 s. 463 -1
$1 001 cav_un_epca*0344703 $1 011 $a 1860-5974 $e 1860-5974 $1 200 1 $a Logical Methods in Computer Science $v Roč. 17, č. 4 (2021) $1 210 $c Logical Methods in Computer Science 610 $a computational complexity 610 $a logic in computer science 610 $a computer science 700 -1
$3 cav_un_auth*0379877 $a Koucký $b M. $y CZ $4 070 701 -1
$3 cav_un_auth*0045922 $a Rödl $b V. $y US $4 070 701 -1
$3 cav_un_auth*0347687 $a Talebanfard $b Navid $p MU-W $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $w Mathematical Logic and Theoretical Computer Science $y IR $4 070 $T Matematický ústav AV ČR, v. v. i. 856 $u https://doi.org/10.46298/lmcs-17(4:17)2021 $9 RIV
Počet záznamů: 1