English

Strongly Exponential Separation Between Monotone VP and Monotone VNP

Computational Complexity 2020-08-03 v2

Abstract

We show that there is a sequence of explicit multilinear polynomials Pn(x1,,xn)R[x1,,xn]P_n(x_1,\ldots,x_n)\in \mathbb{R}[x_1,\ldots,x_n] with non-negative coefficients that lies in monotone VNP such that any monotone algebraic circuit for PnP_n must have size exp(Ω(n)).\exp(\Omega(n)). This builds on (and strengthens) a result of Yehudayoff (2018) who showed a lower bound of exp(Ω~(n)).\exp(\tilde{\Omega}(\sqrt{n})).

Cite

@article{arxiv.1903.01630,
  title  = {Strongly Exponential Separation Between Monotone VP and Monotone VNP},
  author = {Srikanth Srinivasan},
  journal= {arXiv preprint arXiv:1903.01630},
  year   = {2020}
}

Comments

11 pages, to appear in ACM TOCT; new version adds references to results of Kuznetsov, Kasim-Zade, Gashkov and Sergeev

R2 v1 2026-06-23T07:58:17.785Z