Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2012.07056 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913244823683072 |
|---|---|
| author | Kumar, Mrinal Ramya, C. Saptharishi, Ramprasad Tengse, Anamay |
| author_facet | Kumar, Mrinal Ramya, C. Saptharishi, Ramprasad Tengse, Anamay |
| contents | Assuming that the Permanent polynomial requires algebraic circuits of exponential size, we show that the class VNP does not have efficiently computable equations. In other words, any nonzero polynomial that vanishes on the coefficient vectors of all polynomials in the class VNP requires algebraic circuits of super-polynomial size.
In a recent work of Chatterjee and the authors (FOCS 2020), it was shown that the subclasses of VP and VNP consisting of polynomials with bounded integer coefficients do have equations with small algebraic circuits. Their work left open the possibility that these results could perhaps be extended to all of VP or VNP. The results in this paper show that assuming the hardness of Permanent, at least for VNP, allowing polynomials with large coefficients does indeed incur a significant blow up in the circuit complexity of equations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2012_07056 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | If VNP is hard, then so are equations for it Kumar, Mrinal Ramya, C. Saptharishi, Ramprasad Tengse, Anamay Computational Complexity Assuming that the Permanent polynomial requires algebraic circuits of exponential size, we show that the class VNP does not have efficiently computable equations. In other words, any nonzero polynomial that vanishes on the coefficient vectors of all polynomials in the class VNP requires algebraic circuits of super-polynomial size. In a recent work of Chatterjee and the authors (FOCS 2020), it was shown that the subclasses of VP and VNP consisting of polynomials with bounded integer coefficients do have equations with small algebraic circuits. Their work left open the possibility that these results could perhaps be extended to all of VP or VNP. The results in this paper show that assuming the hardness of Permanent, at least for VNP, allowing polynomials with large coefficients does indeed incur a significant blow up in the circuit complexity of equations. |
| title | If VNP is hard, then so are equations for it |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2012.07056 |