Abstract
We show that there is a sequence of explicit multilinear polynomials Pn (x1, … ,xn) ϵ R [x1, … ,xn] with non-negative coefficients that lies in monotone VNP such that any monotone algebraic circuit for Pn must have size exp (Ω (n)) This builds on (and strengthens) a result of Yehudayoff (STOC 2019) who showed a lower bound of exp (Ω(√n)).
- N. Alon and F. R. K. Chung. 1988. Explicit construction of linear sized tolerant networks. Discr. Math. 72, 1 (1988), 15--19. DOI:https://doi.org/10.1016/0012-365X(88)90189-6Google Scholar
Digital Library
- Allan Borodin, Alexander A. Razborov, and Roman Smolensky. 1993. On lower bounds for read-K-times branching programs. Comput. Complex. 3 (1993), 1--18. DOI:https://doi.org/10.1007/BF01200404Google Scholar
Digital Library
- Simone Bova, Florent Capelli, Stefan Mengel, and Friedrich Slivovsky. 2014. Expander CNFs have exponential DNNF size. CoRR abs/1411.1995 (2014).Google Scholar
- Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, and Georg Schnitger. 2004. On multi-partition communication complexity. Inf. Comput. 194, 1 (2004), 49--75. DOI:https://doi.org/10.1016/j.ic.2004.05.002Google Scholar
Cross Ref
- S. B. Gashkov. 1987. On the complexity of monotone computations of polynomials.Vestn. Mosk. Univ., Ser. I 1987, 5 (1987), 7--13.Google Scholar
- Sergey B. Gashkov and Igor S. Sergeev. 2012. A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials. Sbornik Math. 203, 10 (10 2012). DOI:https://doi.org/10.1070/SM2012V203N10ABEH004270Google Scholar
- Thomas P. Hayes. 2011. Separating the k-party communication complexity hierarchy: An application of the Zarankiewicz problem. Discr. Math. Theor. Comput. Sci. 13, 4 (2011), 15--22. Retrieved from http://dmtcs.episciences.org/546.Google Scholar
- Shlomo Hoory, Nathan Linial, and Avi Wigderson. 2006. Expander graphs and their applications. Bull. Amer. Math. Soc. 43, 4 (2006), 439--561.Google Scholar
Cross Ref
- Mark Jerrum and Marc Snir. 1982. Some exact complexity results for straight-line computations over semirings. J. ACM 29, 3 (1982), 874--897. DOI:https://doi.org/10.1145/322326.322341Google Scholar
Digital Library
- Stasys Jukna. 2015. Lower bounds for tropical circuits and dynamic programs. Theor. Comput. Syst. 57, 1 (2015), 160--194. DOI:https://doi.org/10.1007/s00224-014-9574-4Google Scholar
Digital Library
- O. M. Kasim-Zade. 1986. The complexity of monotone polynomials. In Proceedings of the All-union Seminar on Discrete Mathematics and Its Applications. Moskov. Gos. Univ., Mekh.-Mat. Fak., Moscow, 136--138.Google Scholar
- Anup Rao and Amir Yehudayoff. 2020. Communication Complexity: and Applications. Cambridge University Press. DOI:https://doi.org/10.1017/9781108671644Google Scholar
- Ran Raz and Amir Yehudayoff. 2011. Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors. J. Comput. Syst. Sci. 77, 1 (2011), 167--190. DOI:https://doi.org/10.1016/j.jcss.2010.06.013Google Scholar
Digital Library
- Omer Reingold, Salil Vadhan, and Avi Wigderson. 2002. Entropy waves, the zig-zag graph product, and new constant-degree expanders. Ann. Math. 155, 1 (2002), 157--187.Google Scholar
Cross Ref
- Ramprasad Saptharishi. 2015. A survey of lower bounds in arithmetic circuit complexity. Github Survey (2015).Google Scholar
- C.-P. Schnorr. 1976. A lower bound on the number of additions in monotone computations. Theor. Comput. Sci. 2, 3 (1976), 305--315. DOI:https://doi.org/10.1016/0304-3975(76)90083-9Google Scholar
Cross Ref
- Eli Shamir and Marc Snir. 1977. Lower Bounds on the Number of Multiplications and the Number of Additions in Monotone Computations. IBM Thomas J. Watson Research Division.Google Scholar
- Amir Shpilka and Amir Yehudayoff. 2010. Arithmetic circuits: A survey of recent results and open questions. Found. Trends Theoret. Comput. Sci. 5, 3--4 (2010), 207--388. DOI:https://doi.org/10.1561/0400000039Google Scholar
- Leslie G. Valiant. 1979. Completeness classes in algebra. In Proceedings of the 11th Annual ACM Symposium on Theory of Computing. 249--261. DOI:https://doi.org/10.1145/800135.804419Google Scholar
Digital Library
- Leslie G. Valiant. 1980. Negation can be exponentially powerful. Theor. Comput. Sci. 12 (1980), 303--314. DOI:https://doi.org/10.1016/0304-3975(80)90060-2Google Scholar
Cross Ref
- Amir Yehudayoff. 2019. Separating monotone VP and VNP. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC’19). ACM, New York, 425--429.Google Scholar
Digital Library
Index Terms
Strongly Exponential Separation between Monotone VP and Monotone VNP
Recommendations
VNP = VP in the multilinear world
In this note, we show that over fields of any characteristic, exponential sums of Boolean instantiations of polynomials computed by multilinear circuits can be computed by multilinear circuits with polynomial blow-up in size. In particular, multilinear-...
On derandomization and average-case complexity of monotone functions
We investigate whether circuit lower bounds for monotone circuits can be used to derandomize randomized monotone circuits. We show that, in fact, any derandomization of randomized monotone computations would derandomize all randomized computations, ...
Succinct Monotone Circuit Certification: Planarity and Parameterized Complexity
Computing and CombinatoricsAbstractMonotone Boolean circuits are circuits where each gate is either an gate or an gate. In other words, negation gates are not allowed in monotone circuits. This class of circuits has sparked the attention of researchers working in several ...






Comments