@inproceedings{DBLP:conf/coco/ForbesSTW16,
  author    = {Michael A. Forbes and
               Amir Shpilka and
               Iddo Tzameret and
               Avi Wigderson},
  editor    = {Ran Raz},
  title     = {Proof Complexity Lower Bounds from Algebraic Circuit Complexity},
  booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
               June 1, 2016, Tokyo, Japan},
  series    = {LIPIcs},
  volume    = {50},
  pages     = {32:1--32:17},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2016},
  url       = {https://doi.org/10.4230/LIPIcs.CCC.2016.32},
  doi       = {10.4230/LIPIcs.CCC.2016.32},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/coco/ForbesSTW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"YZDwFh2ih4j3pk7ML","bibbaseid":"forbes-shpilka-tzameret-wigderson-proofcomplexitylowerboundsfromalgebraiccircuitcomplexity-2016","authorIDs":[],"author_short":["Forbes, M. A.","Shpilka, A.","Tzameret, I.","Wigderson, A."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","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":[]}],"editor":[{"firstnames":["Ran"],"propositions":[],"lastnames":["Raz"],"suffixes":[]}],"title":"Proof Complexity Lower Bounds from Algebraic Circuit Complexity","booktitle":"31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan","series":"LIPIcs","volume":"50","pages":"32:1–32:17","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2016","url":"https://doi.org/10.4230/LIPIcs.CCC.2016.32","doi":"10.4230/LIPIcs.CCC.2016.32","timestamp":"Tue, 11 Feb 2020 15:52:14 +0100","biburl":"https://dblp.org/rec/conf/coco/ForbesSTW16.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/coco/ForbesSTW16,\n author = {Michael A. Forbes and\n Amir Shpilka and\n Iddo Tzameret and\n Avi Wigderson},\n editor = {Ran Raz},\n title = {Proof Complexity Lower Bounds from Algebraic Circuit Complexity},\n booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to\n June 1, 2016, Tokyo, Japan},\n series = {LIPIcs},\n volume = {50},\n pages = {32:1--32:17},\n publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\\"{u}}r Informatik},\n year = {2016},\n url = {https://doi.org/10.4230/LIPIcs.CCC.2016.32},\n doi = {10.4230/LIPIcs.CCC.2016.32},\n timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},\n biburl = {https://dblp.org/rec/conf/coco/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."],"editor_short":["Raz, R."],"key":"DBLP:conf/coco/ForbesSTW16","id":"DBLP:conf/coco/ForbesSTW16","bibbaseid":"forbes-shpilka-tzameret-wigderson-proofcomplexitylowerboundsfromalgebraiccircuitcomplexity-2016","role":"author","urls":{"Paper":"https://doi.org/10.4230/LIPIcs.CCC.2016.32"},"downloads":0},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/93/9942.bib","creationDate":"2020-02-25T21:38:49.763Z","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"]}