%0 Conference Paper %1 conf/coco/ForbesSTW16 %A Forbes, Michael A. %A Shpilka, Amir %A Tzameret, Iddo %A Wigderson, Avi %B Computational Complexity Conference %D 2016 %E Raz, Ran %I Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik %K dblp %P 32:1-32:17 %T Proof Complexity Lower Bounds from Algebraic Circuit Complexity. %U http://dblp.uni-trier.de/db/conf/coco/coco2016.html#ForbesSTW16 %V 50 %@ 978-3-95977-008-8

@inproceedings{conf/coco/ForbesSTW16, added-at = {2019-12-20T00:00:00.000+0100}, author = {Forbes, Michael A. and Shpilka, Amir and Tzameret, Iddo and Wigderson, Avi}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/20cac7cfcfe85c90df1e88249e78ed50b/dblp}, booktitle = {Computational Complexity Conference}, crossref = {conf/coco/2016}, editor = {Raz, Ran}, ee = {https://doi.org/10.4230/LIPIcs.CCC.2016.32}, interhash = {017d34a0ddb3929f3b30f296e7bc48fa}, intrahash = {0cac7cfcfe85c90df1e88249e78ed50b}, isbn = {978-3-95977-008-8}, keywords = {dblp}, pages = {32:1-32:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, series = {LIPIcs}, timestamp = {2020-01-09T07:57:50.000+0100}, title = {Proof Complexity Lower Bounds from Algebraic Circuit Complexity.}, url = {http://dblp.uni-trier.de/db/conf/coco/coco2016.html#ForbesSTW16}, volume = 50, year = 2016 }