<p>recently there has been major progress into the VP=?VNP problem for algebraic circuits originated by Valiant, inspiring some optimistic outlook on its eventual or imminent resolution.[1]</p>

<blockquote>
  <p>what is an outline/ overview of an intuition that VP=?VNP is connected or <em>not</em> (closely?) connected to the P=?NP problem?</p>
</blockquote>

<p>am looking for "not complex" or "straightforward" sketches or constructions, not necessarily "rigorous".</p>

<p>[1] <a href="http://bulletin.eatcs.org/index.php/beatcs/article/view/293/275" rel="nofollow noreferrer">Recent Progress on Arithmetic Circuit
Lower Bounds</a> / Ramprasad Saptharishi, Bulletin of EATCS </p>

<blockquote>
  <p>The field of arithmetic circuit complexity has lately seen a flurry of results.
  Several of these results are centered homogeneous depth four circuits,
  and come tantalizingly close to separating the algebraic analogue of
  P from the algebraic analogue of NP.</p>
</blockquote>

<p>[2] <a href="https://cstheory.stackexchange.com/questions/529/does-vp-neq-vnp-imply-p-neq-np">Does $VP \neq VNP$ imply $P \neq NP$?</a></p>

CC BY-SA 3.0
2014-11-14T17:43:10.090Z
Your question already seems to be addressed at the question you linked, see Massimo Lauria's answer.
András Salamon
CC BY-SA 4.0
2019-10-07T22:43:58.627Z
Possible duplicate of [Does $VP \neq VNP$ imply $P \neq NP$?](https://cstheory.stackexchange.com/questions/529/does-vp-neq-vnp-imply-p-neq-np)
Joshua Grochow
<cc.complexity-theory><reference-request><big-picture><p-vs-np><arithmetic-circuits>
intuition that VP=?VNP is (not?) connected to P=?NP
vzn
# intuition that VP=?VNP is (not?) connected to P=?NP

(Asked by: username_0 on 2014-11-07)

recently there has been major progress into the VP=?VNP problem for algebraic circuits originated by Valiant, inspiring some optimistic outlook on its eventual or imminent resolution.[1]

> what is an outline/ overview of an intuition that VP=?VNP is connected or *not* (closely?) connected to the P=?NP problem?

am looking for "not complex" or "straightforward" sketches or constructions, not necessarily "rigorous".

[1] [Recent Progress on Arithmetic Circuit
Lower Bounds](http://bulletin.eatcs.org/index.php/beatcs/article/view/293/275) / Ramprasad Saptharishi, Bulletin of EATCS

> The field of arithmetic circuit complexity has lately seen a flurry of results.
> Several of these results are centered homogeneous depth four circuits,
> and come tantalizingly close to separating the algebraic analogue of
> P from the algebraic analogue of NP.

[2] [Does $VP \neq VNP$ imply $P \neq NP$?](https://cstheory.stackexchange.com/questions/529/does-vp-neq-vnp-imply-p-neq-np)

**Tags:** cc.complexity-theory, reference-request, big-picture, p-vs-np, arithmetic-circuits

> **Comments:**
> **username_1**: Your question already seems to be addressed at the question you linked, see Massimo Lauria's answer.  
> **username_2**: Possible duplicate of [Does $VP \neq VNP$ imply $P \neq NP$?](https://cstheory.stackexchange.com/questions/529/does-vp-neq-vnp-imply-p-neq-np)  

---

## 0 answers

