Počet záznamů: 1
On convex complexity measures
SYS 0342826 LBL 01525^^^^^2200313^^^450 005 20240103193501.6 014 $a 000276167000016 $2 WOS 014 $a 77949275187 $2 SCOPUS 017 $a 10.1016/j.tcs.2010.02.004 $2 DOI 100 $a 20100512d m y slo 03 ba 101 0-
$a eng $d eng 102 $a NL 200 1-
$a On convex complexity measures 215 $a 13 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č. 411, 16-18 (2010), s. 1842-1854 $1 210 $c Elsevier 610 0-
$a boolean formula 610 0-
$a complexity measure 610 0-
$a combinatorial rectangle 610 0-
$a convexity 700 -1
$3 cav_un_auth*0261776 $a Hrubeš $b P. $y US $4 070 701 -1
$3 cav_un_auth*0207493 $a Jukna $b S. $y DE $4 070 701 -1
$3 cav_un_auth*0261777 $a Kulikov $b A. $y DE $4 070 701 -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://www.sciencedirect.com/science/article/pii/S0304397510000885
Počet záznamů: 1