@article{DBLP:journals/corr/ForbesSTW16,
  author    = {Michael A. Forbes and
               Amir Shpilka and
               Iddo Tzameret and
               Avi Wigderson},
  title     = {Proof Complexity Lower Bounds from Algebraic Circuit Complexity},
  journal   = {CoRR},
  volume    = {abs/1606.05050},
  year      = {2016},
  url       = {http://arxiv.org/abs/1606.05050},
  archivePrefix = {arXiv},
  eprint    = {1606.05050},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/ForbesSTW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"9KMcv78tsvsmxh8a3","bibbaseid":"forbes-shpilka-tzameret-wigderson-proofcomplexitylowerboundsfromalgebraiccircuitcomplexity-2016","authorIDs":[],"author_short":["Forbes, M. A.","Shpilka, A.","Tzameret, I.","Wigderson, A."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Michael","A."],"propositions":[],"lastnames":["Forbes"],"suffixes":[]},{"firstnames":["Amir"],"propositions":[],"lastnames":["Shpilka"],"suffixes":[]},{"firstnames":["Iddo"],"propositions":[],"lastnames":["Tzameret"],"suffixes":[]},{"firstnames":["Avi"],"propositions":[],"lastnames":["Wigderson"],"suffixes":[]}],"title":"Proof Complexity Lower Bounds from Algebraic Circuit Complexity","journal":"CoRR","volume":"abs/1606.05050","year":"2016","url":"http://arxiv.org/abs/1606.05050","archiveprefix":"arXiv","eprint":"1606.05050","timestamp":"Mon, 13 Aug 2018 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/corr/ForbesSTW16.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/corr/ForbesSTW16,\n author = {Michael A. Forbes and\n Amir Shpilka and\n Iddo Tzameret and\n Avi Wigderson},\n title = {Proof Complexity Lower Bounds from Algebraic Circuit Complexity},\n journal = {CoRR},\n volume = {abs/1606.05050},\n year = {2016},\n url = {http://arxiv.org/abs/1606.05050},\n archivePrefix = {arXiv},\n eprint = {1606.05050},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/ForbesSTW16.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Forbes, M. A.","Shpilka, A.","Tzameret, I.","Wigderson, A."],"key":"DBLP:journals/corr/ForbesSTW16","id":"DBLP:journals/corr/ForbesSTW16","bibbaseid":"forbes-shpilka-tzameret-wigderson-proofcomplexitylowerboundsfromalgebraiccircuitcomplexity-2016","role":"author","urls":{"Paper":"http://arxiv.org/abs/1606.05050"},"downloads":0},"bibtype":"article","biburl":"https://dblp.org/pid/93/9942.bib","creationDate":"2020-02-25T21:38:49.765Z","downloads":0,"keywords":[],"search_terms":["proof","complexity","lower","bounds","algebraic","circuit","complexity","forbes","shpilka","tzameret","wigderson"],"title":"Proof Complexity Lower Bounds from Algebraic Circuit Complexity","year":2016,"dataSources":["vqpLxDotj5ZmjWXjK"]}