
arXiv: 1903.01630
We show that there is a sequence of explicit multilinear polynomials P n (x 1 , … ,x n ) ϵ R [x 1 , … ,x n ] with non-negative coefficients that lies in monotone VNP such that any monotone algebraic circuit for P n must have size exp (Ω ( n )) This builds on (and strengthens) a result of Yehudayoff (STOC 2019) who showed a lower bound of exp (Ω(√n)).
FOS: Computer and information sciences, Computer Science - Computational Complexity, Computational Complexity (cs.CC)
FOS: Computer and information sciences, Computer Science - Computational Complexity, Computational Complexity (cs.CC)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
