Proof Complexity Lower Bounds from Algebraic Circuit Complexity

Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Forbes, M. A., Shpilka, A., Tzameret, I., & Wigderson, A. In 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, volume 50, of LIPIcs, pages 32:1–32:17, 2016. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Paper doi bibtex

@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}
}

Downloads: 0