dasarpmar / lowerbounds-survey

A survey of known lower bounds in arithmetic circuits.
27 stars 15 forks source link

Reference for proof of Theorem 3.5 #22

Closed prateekdwv closed 5 years ago

prateekdwv commented 5 years ago

Proof of VNP=VNPe in Burgisser’s book is hard to follow. A more recent proof of it using Proof-trees due to Malod & Portier (2008) is possibly more understandable and comprehensive enough.

You might be interested in including that reference.

dasarpmar commented 5 years ago

Thanks. Added this in 2377a6f.