A survey of known lower bounds in arithmetic circuits.
The goal is to keep populating this survery with lower bounds in arithmetic circuits. So far, there were two surveys that I was a part of (one with Neeraj Kayal, that appeared in the Special Volume for Somenath Biswas' 60th Birthday, and another by just myself that appeared in the EATCS bulletin). Hopefully this would continue to remain a comprehensive survey of all known lowerbounds in arithmetic circuit complexity.
Perhaps other people can contribute to this too (if I can convince them to!)
For people who are not familiar with using git or github, the wiki (https://github.com/dasarpmar/lowerbounds-survey/wiki/Getting-started-with-github) should be of some help. I shall also keep updating this to assist potential contributors.
Bitbucket repo link: (https://bitbucket.org/dasarpmar/lowerbounds-survey)
Github repo link: (https://github.com/dasarpmar/lowerbounds-survey)
Ramprasad Saptharishi 31st March 2015
This work by Ramprasad Saptharishi is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
