On hardness of multilinearization, and VNP-completeness in characteristics 2

Number of the records: 1

1.

SYSNO	0469668
Title	On hardness of multilinearization, and VNP-completeness in characteristics 2
Author(s)	Hrubeš, Pavel (MU-W)_{RID, SAI, ORCID}
Source Title	ACM Transactions on Computation Theory. Roč. 9, č. 1 (2016). - : Association for Computing Machinery
Article number	1
Document Type	Článek v odborném periodiku
Grant	339691, XE - EU countries
Institutional support	MU-W - RVO:67985840
Language	eng
Country	US
Keywords	boolean formula * complexity measure
URL	http://dl.acm.org/citation.cfm?doid=3007903.2940323
Permanent Link	http://hdl.handle.net/11104/0267481

	File	Download	Size	Commentary	Version	Access
	Hrubes3.pdf	3	208.9 KB		Publisher’s postprint	require

Number of the records: 1