Počet záznamů: 1
On hardness of multilinearization, and VNP-completeness in characteristics 2
SYS 0469668 LBL 01000a^^22220027750^450 005 20240103213436.3 014 $a 85009085885 $2 SCOPUS 014 $a 000392673500001 $2 WOS 017 $a 10.1145/2940323 $2 DOI 100 $a 20170123d m y slo 03 ba 101 $a eng $d eng 102 $a US 200 1-
$a On hardness of multilinearization, and VNP-completeness in characteristics 2 215 $a 14 s. 463 -1
$1 001 cav_un_epca*0430343 $1 011 $a 1942-3454 $1 200 1 $a ACM Transactions on Computation Theory $v Roč. 9, č. 1 (2016) $1 210 $c Association for Computing Machinery 610 $a boolean formula 610 $a complexity measure 700 -1
$3 cav_un_auth*0258893 $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $w Mathematical Logic and Theoretical Computer Science $4 070 $a Hrubeš $b Pavel $p MU-W $y CZ $T Matematický ústav AV ČR, v. v. i. 856 $u http://dl.acm.org/citation.cfm?doid=3007903.2940323
Počet záznamů: 1