Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > VNP COMPLETENESS:
Reports tagged with VNP completeness:
TR15-067 | 21st April 2015
Pavel Hrubes

#### On hardness of multilinearization, and VNP completeness in characteristics two

For a boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$, let $\hat{f}$ be the unique multilinear polynomial such that $f(x)=\hat{f}(x)$ holds for every $x\in \{0,1\}^n$. We show that, assuming $\hbox{VP}\not=\hbox{VNP}$, there exists a polynomial-time computable $f$ such that $\hat{f}$ requires super-polynomial arithmetic circuits. In fact, this $f$ can be taken as a monotone 2-CNF, ... more >>>

ISSN 1433-8092 | Imprint